A FRAMEWORK OF ADAPTED TRAVEL REFERENCES IN ONLINE SOCIAL MEDIA

A.Sai Jyotsna, A. Sangeetha, Venugopal Chetukuri

Abstract


Location information collected from mobile users, knowingly and unknowingly, can reveal not only a user’s latitude and longitude. In this paper, we study approximate k nearest neighbor queries where the mobile user queries the area based company about approximate k nearest sights according to his current location. To judge the security within our solutions, we define a crook model internet hosting in queries. The security analysis has shown our solutions ensures both location privacy meaning the client does not reveal any longer understanding about his place for that LBS provider and query privacy meaning the client does not reveal what type of POIs he's interested in the LBS provider. We're feeling the mobile user can purchase his location from satellites anonymously, coupled with base station coupled with LBS provider don't collude to comprise the customer location privacy or susceptible to anonymous funnel. RSA is not a probabilistic file encryption plan. To alter RSA acquiring a probabilistic file encryption plan, we must be adding random bits for your message m before encrypting m with RSA. The goal of transporting this out must be to ensure the mobile user can buy only one in POIs per query. In addition, once the mobile user can buy a string of encrypted k nearest POIs inside the response within the LBS server, they may frequently run the RR formula simply when using the LBS server to get a sequence of k nearest POIs without passion for query generation and response generation. Performance has shown our fundamental protocol performs much well compared to present PIR based LBS query protocols with regards to both parallel computation and communication overhead.


Keywords


RSA; Location Based Query; Location And Query Privacy; Confidential Information Retrieval; Parlier Cryptosystem;

References


G. Ghinita, P. Kalnis, M. Kantarcioglu, and E. Bertino, “Approximate and exact hybrid algorithms for private nearestneighbor queries with database protection,” GeoInformatica, vol. 15, no. 14, pp. 699–726, 2010.

A. Khoshgozaran and C. Shahabi, “Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy,” in Proc. 10th Int. Conf. Adv. Spatial Temporal Databases, 2007, pp. 239–257.

C. Y. Chow, M. F. Mokbel, and X. Liu, “A peer-to-peer spatial cloaking algorithm for anonymous location-based services,” in Proc. 14th Annu. ACM Int. Symp. Adv. Geograph. Inform. Syst., 2006, pp. 171–178.

R. Michael, “Digitalized signatures and public-key functions as intractable as factorization,” MIT Lab. Comput. Sci., Cambridge, MA, US, Tech. Rep. MIT-LCS-TR-212, Jan. 1979.

P. Shankar, V. Ganapathy, and L. Iftode, “Privately querying location- based services with SybilQuery,” in Proc. 11th Int. Conf. Ubiquitous Comput., 2009, pp. 31–40.

W. K. Wong, D. W. Cheung, B. Kao, and N. Mamoulis, “Secure kNN computation on encrypted databases,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2009, pp. 139–152.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.