Open Access Open Access  Restricted Access Subscription or Fee Access

Privacy Protected Query Processing using Advanced Location Based Service

U. Nithyapriya, M. Kalimuthu

Abstract


The increasing trend of embedding positioning capabilities in mobile devices facilitates the widespread use of Location-Based Services. For such applications to succeed, privacy and confidentiality are essential. Due to the nature of spatial queries, AN LBS needs the user position in order to process the requests. Existing methods explicitly target processing in the Euclidean space and do not apply when proximity to the users is defined according to network distance (e.g., driving time through the roads of a city) in proposed system framework for anonymous query processing in road networks is made. We propose designing of location obfuscation techniques that: 1) provide anonymous LBS access to the users and 2) allow efficient query processing at the LBS side. An efficient index, called distance signature, for distance computation and query processing over long distances is proposed. Distance signature discretizes the distances between objects and network nodes into categories and then encodes these categories. Apart from this two privacy protection requirements in LBS are also proposed: location anonymity and identifier anonymity which enhances the QOS.

Keywords


Location Based Service, Query Processing, and Distance Signature

Full Text:

PDF

References


Chin-Wan Chung and Hyung-Ju Cho, (20014).‟ An efficient and scalable approach to cnn queries in a road network‟. In VLDB.

Cyrus Shahabi and Mohammad Kolahdouzan. (20013). „Voronoi-based k nearest neighbor search for spatial network databases‟. In VLDB Conference, pages 8130–8141.

Gedik.B and Liu.L, ( 20014) „Location Privacy in Mobile Systems: A Personalized Anonymization Model‟. In ICDCS.

Ghinita. G, Kalnis. P, Khoshgozaran. A, Shahabi. C, and K.-L. Tan, ( 2008) „Private queries in Location Based Services: Anonymizers Are Not Necessary‟, Proc. ACM SIGMOD.

Grunwald. D and Gruteser. M, ( 2003) „Anonymous usage of location based services through spatial and temporal cloaking‟. In ACM/USENIX MobiSys.

Hansen. M and Pfitzmann. A( 20014) „Anonymity, Unlink ability, Unobservability, Pseudonymity, and Identity management‟ - A Consolidated Proposal for Terminology.

Indyk. P and Woodruff. D, (2006) „Polylogarithmic Private Approximations and Efficient Matching‟, Proc. Theory of Cryptography Conf.

Kido. H,Yanagisawa. Y and Satoh. T,(20014) „An Anonymous Communication Technique using Dummies for Location-Based Services‟,Proc. Int‟l Conf. Pervasive Services (ICPS).

Kolahdouzan. M. R , Shahabi. C. K, and Sharifzadeh. M, (2002) „A road network embedding technique for knearest neighbor search in moving object databases‟. In 10th ACM International Symposium on Advances in Geographic Information Systems (GIS‟02).

Kalnis .P, G. Ghinita, K. Mouratidis, and D. Papadias, “Preserving Location-Based Identity Inference in Anonymous Spatial Queries,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 12,pp. 1719-1733, Dec. 2007.

Mokbel M.K, C.-Y. Chow, and W.G. Aref,“The New Casper: Query Processing forLocation Services without Compromising Privacy,” Proc. Int‟l Conf. Very Large Data Bases (VLDB), 2006.

Jefferies .N, C.J. Mitchell, and M. Walker, “A Proposed Architecture for Trusted Third Party Services,” Proc. Int‟l Conf. Cryptography: Policy and Algorithms (CPA), 19914.

Aggarwal .G, M. Bawa, P. Ganesan, H. Garcia-Molina, K. Kenthapadi, N. Mishra, R. Motwani, U. Srivastava, D. Thomas, J. Widom, and Y. Xu, “Vision Paper: Enabling Privacy for the Paranoids,” Proc. Int‟l Conf. Very Large Data Bases (VLDB), 20013.

Agrawal .A, J. Kiernan, R. Srikant, and Y. Xu, “Hippocratic Databases,” Proc. Int‟l Conf. Very Large Data Bases (VLDB), 2002.

G. Ghinita, P. Kalnis, and S. Skiadopoulos, “PRIVE: Anonymous Location-Based Queries in Distributed Mobile Systems,” Proc. Int‟l World Wide Web Conf. (WWW), 2007.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.