TY - GEN
T1 - L2P2
T2 - IEEE Conference on Computer Communications, INFOCOM 2012
AU - Wang, Yu
AU - Xu, Dingbang
AU - He, Xiao
AU - Zhang, Chao
AU - Li, Fan
AU - Xu, Bin
PY - 2012
Y1 - 2012
N2 - Location privacy has been a serious concern for mobile users who use location-based services provided by the third-party provider via mobile networks. Recently, there have been tremendous efforts on developing new anonymity or obfuscation techniques to protect location privacy of mobile users. Though effective in certain scenarios, these existing techniques usually assume that a user has a constant privacy requirement along spatial and/or temporal dimensions, which may not be true in real-life scenarios. In this paper, we introduce a new location privacy problem: Location-aware Location Privacy Protection (L2P2) problem, where users can define dynamic and diverse privacy requirements for different locations. The goal of the L2P2 problem is to find the smallest cloaking area for each location request so that diverse privacy requirements over spatial and/or temporal dimensions are satisfied for each user. In this paper, we formalize two versions of the L2P2 problem, and propose several efficient heuristics to provide such location-aware location privacy protection for mobile users. Through multiple simulations on a large data set of trajectories for one thousand mobile users, we confirm the effectiveness and efficiency of the proposed L2P2 algorithms.
AB - Location privacy has been a serious concern for mobile users who use location-based services provided by the third-party provider via mobile networks. Recently, there have been tremendous efforts on developing new anonymity or obfuscation techniques to protect location privacy of mobile users. Though effective in certain scenarios, these existing techniques usually assume that a user has a constant privacy requirement along spatial and/or temporal dimensions, which may not be true in real-life scenarios. In this paper, we introduce a new location privacy problem: Location-aware Location Privacy Protection (L2P2) problem, where users can define dynamic and diverse privacy requirements for different locations. The goal of the L2P2 problem is to find the smallest cloaking area for each location request so that diverse privacy requirements over spatial and/or temporal dimensions are satisfied for each user. In this paper, we formalize two versions of the L2P2 problem, and propose several efficient heuristics to provide such location-aware location privacy protection for mobile users. Through multiple simulations on a large data set of trajectories for one thousand mobile users, we confirm the effectiveness and efficiency of the proposed L2P2 algorithms.
KW - Location privacy
KW - cloaking
KW - k-anonymity
KW - location based service
KW - mobile networks
UR - http://www.scopus.com/inward/record.url?scp=84861601388&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2012.6195577
DO - 10.1109/INFCOM.2012.6195577
M3 - Conference contribution
AN - SCOPUS:84861601388
SN - 9781467307758
T3 - Proceedings - IEEE INFOCOM
SP - 1996
EP - 2004
BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012
Y2 - 25 March 2012 through 30 March 2012
ER -