TY - JOUR
T1 - 2PASS
T2 - Bandwidth-optimized location cloaking for anonymous location-based services
AU - Hu, Haibo
AU - Xu, Jianliang
N1 - Funding Information:
The authors would like to thank the editor and anonymous reviewers for their valuable suggestions that significantly improved the quality of this paper. This work was supported by Research Grants Council, Hong Kong SAR, China, under Projects HKBU FRG/08-09/II-48, FRG2/09-10/047, GRF HKBU211307, and HKBU210808.
PY - 2010/10
Y1 - 2010/10
N2 - Protection of users' location privacy is a critical issue for location-based services. Location cloaking has been proposed to blur users' accurate locations with cloaked regions. Although various cloaking algorithms have been studied, none of the prior work has explored the impact of cloaking on the bandwidth usage of requested services. In this paper, we develop an innovative result-aware location cloaking approach, called 2PASS. Based on the notion of Voronoi cells, 2PASS minimizes the number of objects to request, and hence, the bandwidth while meeting the same privacy requirement. The core component of 2PASS is a lightweight WAG-tree index, based on which efficient and secure client and server procedures are designed. Through threat analysis and experimental results, we argue that 2PASS is robust and outperforms state-of-the-art approaches in terms of various metrics, such as query response time and bandwidth consumption. We also enclose a case study of 2PASS in a real-life application.
AB - Protection of users' location privacy is a critical issue for location-based services. Location cloaking has been proposed to blur users' accurate locations with cloaked regions. Although various cloaking algorithms have been studied, none of the prior work has explored the impact of cloaking on the bandwidth usage of requested services. In this paper, we develop an innovative result-aware location cloaking approach, called 2PASS. Based on the notion of Voronoi cells, 2PASS minimizes the number of objects to request, and hence, the bandwidth while meeting the same privacy requirement. The core component of 2PASS is a lightweight WAG-tree index, based on which efficient and secure client and server procedures are designed. Through threat analysis and experimental results, we argue that 2PASS is robust and outperforms state-of-the-art approaches in terms of various metrics, such as query response time and bandwidth consumption. We also enclose a case study of 2PASS in a real-life application.
KW - distributed applications
KW - integrity
KW - Mobile applications
KW - protection
KW - security
UR - http://www.scopus.com/inward/record.url?scp=77956175701&partnerID=8YFLogxK
U2 - 10.1109/TPDS.2010.26
DO - 10.1109/TPDS.2010.26
M3 - Journal article
AN - SCOPUS:77956175701
SN - 1045-9219
VL - 21
SP - 1458
EP - 1472
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
IS - 10
M1 - 5406506
ER -