TY - GEN
T1 - A peer-to-peer spatial cloaking algorithm for anonymous location-based service
AU - Chow, Chi Yin
AU - Mokbel, Mohamed F.
AU - Liu, Xuan
PY - 2006
Y1 - 2006
N2 - This paper tackles a major privacy threat in current location-based services where users have to report their exact locations to the database server in order to obtain their desired services. For example, a mobile user asking about her nearest restaurant has to report her exact location. With untrusted service providers, reporting private location information may lead to several privacy threats. In this paper, we present a peer-to-peer (P2P)spatial cloaking algorithm in which mobile and stationary users can entertain location-based services without revealing their exact location information. The main idea is that before requesting any location-based service, the mobile user will form a group from her peers via single-hop communication and/or multi-hop routing. Then,the spatial cloaked area is computed as the region that covers the entire group of peers. Two modes of operations are supported within the proposed P2P s patial cloaking algorithm, namely, the on-demand mode and the proactive mode. Experimental results show that the P2P spatial cloaking algorithm operated in the on-demand mode has lower communication cost and better quality of services than the proactive mode, but the on-demand incurs longer response time.
AB - This paper tackles a major privacy threat in current location-based services where users have to report their exact locations to the database server in order to obtain their desired services. For example, a mobile user asking about her nearest restaurant has to report her exact location. With untrusted service providers, reporting private location information may lead to several privacy threats. In this paper, we present a peer-to-peer (P2P)spatial cloaking algorithm in which mobile and stationary users can entertain location-based services without revealing their exact location information. The main idea is that before requesting any location-based service, the mobile user will form a group from her peers via single-hop communication and/or multi-hop routing. Then,the spatial cloaked area is computed as the region that covers the entire group of peers. Two modes of operations are supported within the proposed P2P s patial cloaking algorithm, namely, the on-demand mode and the proactive mode. Experimental results show that the P2P spatial cloaking algorithm operated in the on-demand mode has lower communication cost and better quality of services than the proactive mode, but the on-demand incurs longer response time.
KW - Location privacy and spatial cloaking
KW - Location-based services
KW - Mobile computing
UR - http://www.scopus.com/inward/record.url?scp=34547474184&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547474184&partnerID=8YFLogxK
U2 - 10.1145/1183471.1183500
DO - 10.1145/1183471.1183500
M3 - Conference contribution
AN - SCOPUS:34547474184
SN - 1595935290
SN - 9781595935298
T3 - GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
SP - 171
EP - 178
BT - Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems, ACM-GIS'06
T2 - 14th Annual ACM International Symposium on Advances in Geographic Information Systems, ACM-GIS'06
Y2 - 6 November 2006 through 11 November 2006
ER -