A k-anonymous location privacy protection method of dummy based on geographical semantics

被引:9
|
作者
Zhang, Yong-Bing [1 ,2 ]
Zhang, Qiu-Yu [1 ]
Li, Zong-Yi [2 ]
Yan, Yan [1 ]
Zhang, Mo-Yi [1 ]
机构
[1] School of Computer and Communication, Lanzhou University of Technology, No. 287, Lan-Gong-Ping Road, Lanzhou,730050, China
[2] Gansu Institute of Mechanical and Electrical Engineering, No. 107, Chi-Yu Road, Tianshui, Gansu,741001, China
关键词
Location - Efficiency - Clustering algorithms;
D O I
10.6633/IJNS.20191121(6).07
中图分类号
学科分类号
摘要
Dummy is one of the main methods used to protect location privacy. In existing methods, the efficiency of dummy generation is low, and the geographical semantic information of location is not fully taken into account. In order to solve these problems, a k-anonymous location privacy protection method of dummy based on geo-graphical semantics was proposed in this paper. Firstly, the location data set in the rectangle region containing the real location is obtained from WiFi APs. Secondly, adopting the multicenter clustering algorithm based on max-min distance, some locations are selected. Its geo-graphical distance between them is the farthest, and a candidate set of dummies is generated. Finally, by calculating the edit-distance between geographic name's information of locations, the semantic similarity between any two locations in the candidate set is obtained, and k-1 locations with the minimum semantic similarity are selected as dummies. Experimental results show that the proposed method can ensure the physical dispersion and semantic diversity of locations, as well as the improvement of the efficiency of dummy generation. Meanwhile, the balance between privacy protection security and query service quality is achieved. © 2019 Femto Technique Co., Ltd.
引用
收藏
页码:937 / 946
相关论文
共 50 条
  • [1] A k-anonymous location privacy protection method of dummy based on approximate matching
    Zhang, Yong-Bing
    Zhang, Qiu-Yu
    Li, Zong-Yi
    Duan, Hong-Xiang
    Zhang, Mo-Yi
    Kongzhi yu Juece/Control and Decision, 2020, 35 (01): : 65 - 73
  • [2] All-dummy k-anonymous privacy protection algorithm based on location offset
    Liu, Jianghui
    Wang, Shengxiang
    COMPUTING, 2022, 104 (08) : 1739 - 1751
  • [3] All-dummy k-anonymous privacy protection algorithm based on location offset
    Jianghui Liu
    Shengxiang Wang
    Computing, 2022, 104 : 1739 - 1751
  • [4] K-anonymous location privacy protection scheme for the mobile terminal
    Song C.
    Jin T.
    Ni S.
    He J.
    Du S.
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2021, 48 (03): : 138 - 145
  • [5] A New Method of Privacy Protection: Random k-Anonymous
    Song, Fagen
    Ma, Tinghuai
    Tian, Yuan
    Al-Rodhaan, Mznah
    IEEE ACCESS, 2019, 7 : 75434 - 75445
  • [6] Location privacy-preserving method of k-anonymous based on service similarity
    Ye, A-Yong
    Li, Ya-Cheng
    Ma, Jian-Feng
    Xu, Li
    Tongxin Xuebao/Journal on Communications, 2014, 35 (11): : 162 - 169
  • [7] k-Anonymous Data Privacy Protection Mechanism Based on Optimal Clustering
    Zhang Q.
    Ye A.
    Ye G.
    Deng H.
    Chen A.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2022, 59 (07): : 1625 - 1635
  • [8] Similarity-based privacy protection for publishing k-anonymous trajectories
    Wang, Shuai
    Chen, Chunyi
    Zhang, Guijie
    FRONTIERS OF COMPUTER SCIENCE, 2022, 16 (03)
  • [9] Similarity-based privacy protection for publishing k-anonymous trajectories
    WANG Shuai
    CHEN Chunyi
    ZHANG Guijie
    Frontiers of Computer Science, 2022, 16 (03)
  • [10] KLPPS: A k-Anonymous Location Privacy Protection Scheme via Dummies and Stackelberg Game
    Yang, Dongdong
    Ye, Baopeng
    Zhang, Wenyin
    Zhou, Huiyu
    Qian, Xiaobin
    Security and Communication Networks, 2021, 2021