Sri. K.Siva Kumar, Sri. P.Rama Krishna, Dr.Shaheda Akthar, Dr.Shaik Mohammad Rafi


Location message still from peripatetic users, wittingly and unconsciously, can concede way over only a user’s ordinate and abscissa. Within this report, we survey bordering k nearest adjoin queries whither the peripatetic user queries the neighborhood positioned firm through bordering k nearest sights occupying on his stream whereabouts. To weigh the assurance in our solutions, we construe a safecracker create web hosting in queries. The security reasoning has proven our solutions ensures both scene penetralium sense the user doesn't expose any fine points roughly his neighborhood to the LBS worker and interrogate separateness spirit the user doesn't expose whichever kind of POIs he's excited to the LBS worker. We consider that the mobile user can buy his position from satellites unnamed, and the central administration and the LBS laborer taboo plot to involve the user scene concealment or competent is an unnamed siphon. RSA isn't a probabilistic file encryption plan. To transform RSA to some probabilistic file encryption plan, we behoove then add indiscriminate bits worldly the theme m previously encrypting m with RSA. The ambition of deed this enjoy approving that the peripatetic user can achieve just one in POIs per quiz. Additionally, when the locomotive user can have a chain of encrypted k nearest POIs in reach the reply in the LBS assistant, he incurs time and again run the RR form just with the LBS waiter to purchase a progression of k nearest POIs on the outside precondition of quiz crop and return step. Performance has proven our law contract performs much well than PIR planted LBS enquire obligations when it comes to both complementary reckoning and information overhead.


RSA; Location Based Query; Location And Query Privacy; Private Information Retrieval; Paillier Cryptosystem;


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

A. Khoshgozaran and C. Shahabi, “Blind evaluation of nearestneighbor queries using space transformation to preserve locationprivacy,” 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 spatialcloaking algorithm for anonymous location-based services,” inProc. 14th Annu. ACM Int. Symp. Adv. Geograph. Inform. Syst., 2006,pp. 171–178.

R. Michael, “Digitalized signatures and public-key functions asintractable 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. UbiquitousComput., 2009, pp. 31–40.

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

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2021, All rights reserved.|

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