A Random Anonymity Framework for Location Privacy  

作　　者：YANG Songtao YIN Guisheng MA Chunguang 

机构地区：[1]College of Computer Science and Technology,Harbin Engineering University [2]College of Information and Electronic Technology,Jiamusi University

出　　处：《Wuhan University Journal of Natural Sciences》2015年第6期521-529,共9页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China(61472097);Specialized Research Fund for the Doctoral Program of Higher Education of China(20132304110017);Natural Science Foundation of Heilongjiang Province of China(F2015022)

摘　　要：Location k-anonymity techniques typically use anony- mous spatial region to ensure privacy. But these solutions are vul- nerable to multiple queries attacks and inference attacks. Failing to account for the obstacle in geographic space is a severe problem since adversaries will surely regard these constraints. A novel framework is proposed to enhance location-dependent queries, based on the theoretical work of k-anonymity and Voronoi diagrams, allows a user to express service requirement and privacy require- ment by specifying a region and an appropriate value ofk. A trusted anonymity server form a restricted set （k, r, s）, which is composed of a number of discrete points to meet the requirements for location k-anonymity and location /-diversity. The location-based services （LBS） server implements an efficient algorithm for continu- ous-region-query processing. Simulation results demonstrated that the framework is superior to previous works in terms of privacy. Moreover, discreteness and randomness of the anonymous set are conducive to resisting location tracking attacks.Location k-anonymity techniques typically use anony- mous spatial region to ensure privacy. But these solutions are vul- nerable to multiple queries attacks and inference attacks. Failing to account for the obstacle in geographic space is a severe problem since adversaries will surely regard these constraints. A novel framework is proposed to enhance location-dependent queries, based on the theoretical work of k-anonymity and Voronoi diagrams, allows a user to express service requirement and privacy require- ment by specifying a region and an appropriate value ofk. A trusted anonymity server form a restricted set （k, r, s）, which is composed of a number of discrete points to meet the requirements for location k-anonymity and location /-diversity. The location-based services （LBS） server implements an efficient algorithm for continu- ous-region-query processing. Simulation results demonstrated that the framework is superior to previous works in terms of privacy. Moreover, discreteness and randomness of the anonymous set are conducive to resisting location tracking attacks.

关 键 词：data privacy location-based services（LBS） trusted third party K-ANONYMITY 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]