系统工程与电子技术 ›› 2021, Vol. 43 ›› Issue (2): 561-566.doi: 10.12305/j.issn.1001-506X.2021.02.31

• 通信与网络 • 上一篇    下一篇

匿名区域层级扩张的位置隐私保护方法

张磊1,2(), 马春光3,*(), 印桂生1()   

  1. 1. 哈尔滨工程大学计算机科学与技术学院, 黑龙江 哈尔滨 150001
    2. 佳木斯大学信息电子技术学院, 黑龙江 佳木斯 154007
    3. 山东科技大学计算机科学与工程学院, 山东 青岛 266590
  • 收稿日期:2019-11-12 出版日期:2021-02-01 发布日期:2021-03-16
  • 通讯作者: 马春光 E-mail:8213662@163.com;machunguang@sdust.edu.cn;yinguisheng@hrbeu.edu.cn
  • 作者简介:张磊(1982-),男,副教授,博士,主要研究方向为信息安全、位置隐私保护。E-mail:8213662@163.com|印桂生(1964-),男,教授,博士,主要研究方向为数据挖掘、虚拟现实研究。E-mail:yinguisheng@hrbeu.edu.cn
  • 基金资助:
    国家自然科学基金重点项目(61932005);NSFC-通用技术基础研究联合基金(U1936112);中国博士后基金(2019M661260);黑龙江省自然科学基金优秀青年项目(YQ2019F018);黑龙江省自然科学基金(LH2019F011)

Location privacy protection method of anonymous region hierarchy expansion

Lei ZHANG1,2(), Chunguang MA3,*(), Guisheng YIN1()   

  1. 1. College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
    2. College of Information and Electronic Technology, Jiamusi University, Jiamusi 154007, China
    3. College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China
  • Received:2019-11-12 Online:2021-02-01 Published:2021-03-16
  • Contact: Chunguang MA E-mail:8213662@163.com;machunguang@sdust.edu.cn;yinguisheng@hrbeu.edu.cn

摘要:

针对传统中心点匿名区域扩张方法中用户位置可预测的问题,提出一种匿名区域按照匿名用户离散距离层级扩张的位置隐私保护方法。首先,将位置区域按照匿名用户离散间距进行划分,并利用希尔伯特曲线按照间距递进的原则建立具有不同离散间距层级的N-阶位置区域四叉树。其次,基于该四叉树用户可选择不同离散程度的匿名区域,防止由于匿名用户密度导致的隐私泄露。同时,由于用户并不位于匿名中心,又可有效应对诸如用户距离差分攻击、中心区域选择攻击等攻击方法。最后,通过安全性分析给出了该算法的理论依据。实验验证与同类算法的比较,进一步展示了所提算法相比于同类算法的优越性。

关键词: 位置隐私保护, 希尔伯特曲线, N-阶层级, 区域四叉树

Abstract:

Aiming at the problem that the user's location can be predicted in the traditional central point anonymous region expansion method, a location privacy protection method based on the hierarchy expansion of anonymous regions according to the anonymous user's discrete distance is proposed. Firstly, the location region is divided according to the discrete distance of anonymous users, and then the N-order location region quad tree with different levels of discrete distance is established by using Hilbert curve according to the principle of interval progression. Secondly, based on the quad tree, users can choose anonymity regions with different discrete degrees to prevent privacy leakage due to the density of anonymous users. At the same time, since the user is not located in the anonymous center, it can effectively deal with attack methods such as user distance differential attack and central area selection attack. Finally, the theoretical basis of the algorithm is given through the security analysis. The comparision between experimental verification and similar algorithms show that the proposed algorithm is superior to other similar algorithms.

Key words: location privacy protection, Hilbert curve, N-hierarchy, region quad tree

中图分类号: