KLPPS: A k-Anonymous Location Privacy Protection Scheme via Dummies and Stackelberg Game

被引:0
|
作者
Yang, Dongdong [1 ,2 ]
Ye, Baopeng [3 ]
Zhang, Wenyin [4 ]
Zhou, Huiyu [5 ]
Qian, Xiaobin [6 ]
机构
[1] State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang,550025, China
[2] Guangxi Key Laboratory of Cryptography and Information Security, Guilin, China
[3] Information Technology Innovation Sercive Center of Guizhou Province, Guiyang, China
[4] School of Information Science and Engineering, Linyi University, Shandong, Linyi,276000, China
[5] School of Informatics, University of Leicester, Leicester, United Kingdom
[6] Guizhou CoVision Science and Technology Co., Ltd, Guiyang, China
关键词
Semantics - Quality of service;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Protecting location privacy has become an irreversible trend; some problems also come such as system structures adopted by location privacy protection schemes suffer from single point of failure or the mobile device performance bottlenecks, and these schemes cannot resist single-point attacks and inference attacks and achieve a tradeoff between privacy level and service quality. To solve these problems, we propose a k-anonymous location privacy protection scheme via dummies and Stackelberg game. First, we analyze the merits and drawbacks of the existing location privacy preservation system architecture and propose a semitrusted third party-based location privacy preservation architecture. Next, taking into account both location semantic diversity, physical dispersion, and query probability, etc., we design a dummy location selection algorithm based on location semantics and physical distance, which can protect users' privacy against single-point attack. And then, we propose a location anonymous optimization method based on Stackelberg game to improve the algorithm. Specifically, we formalize the mutual optimization of user-adversary objectives by using the framework of Stackelberg game to find an optimal dummy location set. The optimal dummy location set can resist single-point attacks and inference attacks while effectively balancing service quality and location privacy. Finally, we provide exhaustive simulation evaluation for the proposed scheme compared with existing schemes in multiple aspects, and the results show that the proposed scheme can effectively resist the single-point attack and inference attack while balancing the service quality and location privacy. © 2021 Dongdong Yang et al.
引用
收藏
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [3] A k-anonymous location privacy protection method of dummy based on geographical semantics
    Zhang, Yong-Bing
    Zhang, Qiu-Yu
    Li, Zong-Yi
    Yan, Yan
    Zhang, Mo-Yi
    International Journal of Network Security, 2019, 21 (06) : 937 - 946
  • [4] 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
  • [5] All-dummy k-anonymous privacy protection algorithm based on location offset
    Liu, Jianghui
    Wang, Shengxiang
    COMPUTING, 2022, 104 (08) : 1739 - 1751
  • [6] A New Method of Privacy Protection: Random k-Anonymous
    Song, Fagen
    Ma, Tinghuai
    Tian, Yuan
    Al-Rodhaan, Mznah
    IEEE ACCESS, 2019, 7 : 75434 - 75445
  • [7] All-dummy k-anonymous privacy protection algorithm based on location offset
    Jianghui Liu
    Shengxiang Wang
    Computing, 2022, 104 : 1739 - 1751
  • [8] Efficient Algorithms for K-Anonymous Location Privacy in Participatory Sensing
    Khuong Vu
    Zheng, Rong
    Gao, Jie
    2012 PROCEEDINGS IEEE INFOCOM, 2012, : 2399 - 2407
  • [9] A Caching-Based Dual K-Anonymous Location Privacy-Preserving Scheme for Edge Computing
    Zhang, Shiwen
    Hu, Biao
    Liang, Wei
    Li, Kuan-Ching
    Gupta, Brij B.
    IEEE INTERNET OF THINGS JOURNAL, 2023, 10 (11) : 9768 - 9781
  • [10] 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