Privacy-Area Aware Dummy Generation Algorithms for Location-Based Services

被引:0
作者
Niu, Ben [1 ]
Zhang, Zhengyan [2 ]
Li, Xiaoqing [1 ]
Li, Hui [1 ]
机构
[1] Xidian Univ, Natl Key Lab Integrated Networks Serv, Xian, Peoples R China
[2] Wuhan Univ Technol, Sch Logist Engn, Wuhan 430070, Peoples R China
来源
2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2014年
关键词
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Location-Based Services (LBSs) have been one of the most popular activities in our daily life. Users can send queries to the LBS server easily to learn their surroundings. However, these location-related queries may result in serious privacy concerns since the un-trusted LBS server has all the information about users and may track them in various ways. In this paper, we propose two dummy-based solutions to achieve k-anonymity for privacy-area aware users in LBSs with considering that side information may be exploited by adversaries. We first choose some candidates based on a virtual circle or grid method, then blur these candidates into the final positions of dummy locations based on the entropy-based privacy metric. Security analysis and evaluation results indicate that the V-circle solution can significantly improve the privacy anonymity level. The V-grid solution can further enlarge the cloaking region while keeping similar privacy level.
引用
收藏
页码:957 / 962
页数:6
相关论文
共 17 条
[1]   Location privacy in pervasive computing [J].
Beresford, AR ;
Stajano, F .
IEEE PERVASIVE COMPUTING, 2003, 2 (01) :46-55
[2]  
Bilogrevic I., 2011, ACM PETS 2011
[3]  
Chow C.-Y., ACM GIS 2006
[4]   Casper: Query Processing for Location Services without Compromising Privacy [J].
Chow, Chi-Yin ;
Mokbel, Mohamed F. ;
Aref, Walid G. .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2009, 34 (04)
[5]  
Frejinger E, 2008, THESIS
[6]  
Gruteser M., ACM MOBISYS 2003
[7]  
Kido H., IEEE ICPS 2005
[8]  
Liu X., IEEE INFOCOM 2013
[9]  
Lu H., ACM MOBIDE 2008
[10]  
Ma C., ACM MOBICOM 2010