Enhanced Location Privacy Preserving Scheme in Location-Based Services

With the increasing popularity of mobile communication devices loaded with positioning capabilities (e.g., GPS), there is growing demand for enjoying location-based services (LBSs). An important problem in LBSs is the disclosure of a user's real location while interacting with the location service provider (LSP). To address this issue, existing solutions generally introduce a trusted Anonymizer between the users and the LSP. However, the introduction of an Anonymizer actually transfers the security risks from the LSP to the Anonymizer. Once the Anonymizer is compromised, it may put the user information in jeopardy. In this paper, we propose an enhanced-location-privacy-preserving scheme for the LBS environment. Our scheme employs an entity, termed Function Generator, to distribute the spatial transformation parameters periodically, with which the users and the LSP can perform the mutual transformation between a real location and a pseudolocation. Without the transforming parameters, the Anonymizer cannot have any knowledge about a user's real location. The main merits of our scheme include the following: 1) no fully trusted entities are required, and 2) each user can obtain accurate points of interest while preserving location privacy. The efficiency and effectiveness of the proposed scheme are validated by extensive experiments. The experimental results show that the proposed scheme preserves location privacy at low computational and communication cost.

[1]  Marco Gruteser,et al.  USENIX Association , 1992 .

[2]  Der-Tsai Lee On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[3]  Tetsuji Satoh,et al.  An anonymous communication technique using dummies for location-based services , 2005, ICPS '05. Proceedings. International Conference on Pervasive Services, 2005..

[4]  Günther F. Schrack,et al.  Encoding and decoding the Hilbert order , 1996 .

[5]  Panos Kalnis,et al.  A reciprocal framework for spatial K-anonymity , 2010, Inf. Syst..

[6]  Panos Kalnis,et al.  Providing K-Anonymity in location based services , 2010, SKDD.

[7]  Xinwen Fu,et al.  Protection of query privacy for continuous location based services , 2011, 2011 Proceedings IEEE INFOCOM.

[8]  Jianliang Xu,et al.  Protecting Location Privacy against Location-Dependent Attacks in Mobile Services , 2008, IEEE Transactions on Knowledge and Data Engineering.

[9]  Xinwen Fu,et al.  CAP: A Context-Aware Privacy Protection System for Location-Based Services , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[10]  Jonathan K. Lawder Calculation of Mappings Between One and n-dimensional Values Using the Hilbert Space-filling Curve ⋆ , 2009 .

[11]  Yu Zhang,et al.  Preserving User Location Privacy in Mobile Data Management Infrastructures , 2006, Privacy Enhancing Technologies.

[12]  Chi-Yin Chow,et al.  A peer-to-peer spatial cloaking algorithm for anonymous location-based service , 2006, GIS '06.

[13]  Kyriakos Mouratidis,et al.  Preventing Location-Based Identity Inference in Anonymous Spatial Queries , 2007, IEEE Transactions on Knowledge and Data Engineering.

[14]  Matthew Green,et al.  Identity-Based Proxy Re-encryption , 2007, ACNS.

[15]  Hua Lu,et al.  SpaceTwist: Managing the Trade-Offs Among Location Privacy, Query Performance, and Query Accuracy in Mobile Services , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[16]  Kang G. Shin,et al.  Privacy protection for users of location-based services , 2012, IEEE Wireless Communications.

[17]  Josep Domingo-Ferrer,et al.  Location Privacy in Location-Based Services: Beyond TTP-based Schemes , 2008, PiLBA.

[18]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[19]  Qin Liu,et al.  Cooperative private searching in clouds , 2012, J. Parallel Distributed Comput..

[20]  J. H. Shapiro,et al.  A class of fast algorithms for the Peano-Hilbert space-filling curve , 1994, Proceedings of 1st International Conference on Image Processing.

[21]  Haibo Hu,et al.  Range Nearest-Neighbor Query , 2006, IEEE Trans. Knowl. Data Eng..

[22]  Ling Liu,et al.  A Customizable k-Anonymity Model for Protecting Location Privacy , 2004 .

[23]  Cyrus Shahabi,et al.  Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy , 2007, SSTD.

[24]  Ling Liu,et al.  Location Privacy in Mobile Systems: A Personalized Anonymization Model , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[25]  D. Hilbert Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[26]  Rong Zheng,et al.  Efficient algorithms for K-anonymous location privacy in participatory sensing , 2012, 2012 Proceedings IEEE INFOCOM.

[27]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[28]  Josep Domingo-Ferrer,et al.  Microaggregation for Database and Location Privacy , 2006, NGITS.

[29]  Qin Liu,et al.  A Scalable Encryption Scheme for Multi-Privileged Group Communications , 2010, EUC.

[30]  Xiaohui Liang,et al.  A Dynamic Privacy-Preserving Key Management Scheme for Location-Based Services in VANETs , 2012, IEEE Transactions on Intelligent Transportation Systems.

[31]  Panos Kalnis,et al.  MobiHide: A Mobilea Peer-to-Peer System for Anonymous Location-Based Queries , 2007, SSTD.

[32]  Panos Kalnis,et al.  Private queries in location based services: anonymizers are not necessary , 2008, SIGMOD Conference.

[33]  Qin Liu,et al.  A Secure Self-Destructing Scheme for Electronic Data , 2010, 2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.