Protecting Location Privacy against Location-Dependent Attacks in Mobile Services

被引:147
作者
Pan, Xiao [1 ,2 ]
Xu, Jianliang [3 ]
Meng, Xiaofeng [1 ]
机构
[1] Renmin Univ China, Sch Informat, Beijing, Peoples R China
[2] Shijiazhuang Tiedao Univ, Sch Econ & Management, Shijiazhuang, Peoples R China
[3] Hong Kong Baptist Univ, Dept Comp Sci, Kln, Hong Kong, Peoples R China
关键词
Location privacy; mobile data management; location-based services; ANONYMITY;
D O I
10.1109/TKDE.2011.105
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Privacy protection has recently received considerable attention in location-based services. A large number of location cloaking algorithms have been proposed for protecting the location privacy of mobile users. In this paper, we consider the scenario where different location-based query requests are continuously issued by mobile users while they are moving. We show that most of the existing k-anonymity location cloaking algorithms are concerned with snapshot user locations only and cannot effectively prevent location-dependent attacks when users' locations are continuously updated. Therefore, adopting both the location k-anonymity and cloaking granularity as privacy metrics, we propose a new incremental clique-based cloaking algorithm, called ICliqueCloak, to defend against location-dependent attacks. The main idea is to incrementally maintain maximal cliques needed for location cloaking in an undirected graph that takes into consideration the effect of continuous location updates. Thus, a qualified clique can be quickly identified and used to generate the cloaked region when a new request arrives. The efficiency and effectiveness of the proposed ICliqueCloak algorithm are validated by a series of carefully designed experiments. The experimental results also show that the price paid for defending against location-dependent attacks is small.
引用
收藏
页码:1506 / 1519
页数:14
相关论文
共 39 条
[1]  
Abul O, 2008, PROC INT CONF DATA, P376, DOI 10.1109/ICDE.2008.4497446
[2]  
[Anonymous], PROCEEDINGS
[3]  
[Anonymous], P 9 INT C MOB DAT MA
[4]  
[Anonymous], P 5 INT C PERV COMP
[5]  
[Anonymous], 2008, T BRINKHOFF NETWORK
[6]  
[Anonymous], 2006, ATHENS TRUCKS DATA
[7]  
[Anonymous], 2006, P 32 INT C VER LARG
[8]  
[Anonymous], P 16 INT C WORLD WID
[9]  
Bamba B., 2008, P 17 INT C WORLD WID
[10]  
Bettini C, 2005, LECT NOTES COMPUT SC, V3674, P185