26Feb 2019

SPATIAL LOCATION OF ASSURANCE WITH WITNESS OF MUTUAL PROOFS PROVIDING PRIVACY FOR MOBILE USERS.

  • M.Tech Student, Dept of CSE, Sreenidhi Institute Of Science And Technology, Ts.
  • AsstProfessor, Dept of CSE, Sreenidhi Institute Of Science And Technology, Ts.
Crossref Cited-by Linking logo

  • Abstract
  • Keywords
  • References
  • Cite This Article as
  • Corresponding Author

In our safe tourist application or travelling we aims to outsource the lbs data from the lbs provider to the cloud and from the cloud to the lbs provider which protects the privacy related issues of the lbs data. Initially lbs user query for a place to the lbs provider, lbs provider in turn upload the details to the cloud but in the form of encrypted text to prevent the cloud from stealing the data. Lbs users in turn decrypt the details by the personal password send by the lbs provider to the lbs user. When the query of the lbs user matches the details in the cloud the lbs user will retrieve the details and make use of it. In this application it is shown with the demo of a tourist requesting for tourist places tourist is the lbs user and admin is the lbs provider .With the pervasiveness of smart phones, location based services (LBS) have received considerable attention and become more popular and vital recently. However, the use of LBS also poses a potential threat to user?s location privacy. In this paper, aiming at spatial range query, popular LBS providing information About POIs (Points of Interest), we present an efficient and privacy-preserving location based query solution, called SPATIAL RANGE. To reduce query latency, we further design a privacy-preserving tree index structure in SPATIAL RANGE. Detailed security analysis confirms the security properties of SPATIAL RANGE. In addition, extensive experiments are conducted, and the results demonstrate that spatial range is very efficient in privacy preserving spatial range query over outsourced encrypted data. In particular, for a mobile LBS user using an Android phone, around 0.9 second is needed to generate a query; and it also only requires a commodity workstation, which plays the role of the cloud in our experiments, a few seconds to search POIs.

  1. Gutscher, ?Coordinate transformation?A solution for the privacy problem of location based services?? in Proc. 20th Int. Parallel Distrib. Process. Symp. (IPDPS?06), Rhodes Island, Greece, Apr. 25?29, 2006, p.424.
  2. K. Wong, D. W.-l. Cheung, B. Kao, and N.? Mamoulis,? ?Secure kNN computation on encrypted databases,? in Proc. SIGMOD, 2009, pp.139?152.
  3. Ghinita, P. Kalnis, A. Khoshgozaran, C. Shahabi, and K.-L. Tan, ?Private queries in location based services: Anonymizers are not neces- sary,? in Proc. SIGMOD, 2008, pp.121?132.
  4. Yi, R. Paulet, E. Bertino, and V. Varadharajan, ?Practical k nearest neighbor queries with location privacy,? in Proc. 30th Int. Conf. Data Eng. (ICDE), 2014, pp.640?651.
  5. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, ?Private informa- tionretrieval,? J. ACM, vol. 45, no. 6, pp. 965?981,1998.
  6. Olumofin and I. Goldberg, ?Revisiting the computational practicality of private information retrieval,? in Financial Cryptography and Data Security. New York, NY: Springer, 2012, pp.158?172.
  7. Katz, A. Sahai, and B. Waters, ?Predicate encryption supporting dis- junctions, polynomial equations, and inner products,? in Proc. 27th Ann. Int. Conf. Theory Appl. Cryptograph. Tech. Adv. Cryptol. (EUROCRYPT ?08), Istanbul, Turkey, Apr. 13?17, 2008, pp.146?162.
  8. Boneh and B. Waters, ?Conjunctive, subset, and range queries on encrypted data,? in Proc. 4th Theory Cryptograph. Conf. (TCC?07), Amsterdam, The Netherlands, Feb. 21?24, 2007, pp.535?554.
  9. Boneh and M. K. Franklin, ?Identity-based encryption from the Weil pairing,? SIAM J. Comput., vol. 32, no. 3, pp. 586?615,2003.
  10. White and R. Jain, ?Similarity indexing with the ss-tree,? in Proc. 12th Int. Conf. Data Eng. (ICDE), 1996, pp.516?523.
  11. Guttman, ?R-trees: A dynamic index structure for spatial searching,? in Proc. Annu. Meeting (SIGMOD?84), Boston, MA, USA, Jun. 18?21, 1984, pp.47?57.
  12. K. Dang, J. K?ng, and R. Wagner, ?The sh-tree: A super hybrid index structure for multidimensional data,? in Proc. 12th Int. Conf. Database Expert Syst. Appl. (DEXA? 01), Munich, Germany,? Sep.? 3?5,? 2001, pp.340?349.
  13. -Y. Yang and J.-M. Chen, ?All in the XL family: Theory andpractice,? in Proc. Int. Conf. Inf. Secur. Cryptol, 2004, pp.67?86.
  14. Ars,J.-C.Faugere,H.Imai,M.Kawazoe,andM.Sugita,?Comparison betweenXLandGr?bnerbasisalgorithms,?inProc.ASIACRYPT,2004, pp.338?353.
  15. Yao, F. Li, and X. Xiao, ?Secure nearest neighbor revisited,? in Proc. IEEE 29th Int. Conf. Data Eng. (ICDE?13), 2013, pp.733?744.
  16. Elmehdwi, B. K. Samanthula, and W. Jiang, ?Secure k-nearest neigh- borqueryoverencrypteddatainoutsourcedenvironments,?inProc.IEEE 30th Int. Conf. Data Eng. (ICDE), 2014, pp.664?675.
  17. Khoshgozaran and C. Shahabi, ?Blind evaluation of nearest neigh- bor queries using space transformation to preserve location privacy,? in Advances in Spatial and Temporal Databases. New York, NY, USA: Springer, 2007, pp.239?257.
  18. Hore, S. Mehrotra, M. Canim, and M. Kantarcioglu, ?Secure multidi- mensional range queries over outsourced data,? VLDB J., vol. 21, no. 3, pp. 333?358,2012.
  19. -T.Lien,Y.-H.Lin,J.-R.Shieh,andJ.-L.Wu,?Anovelprivacypreserv- ing location-based service protocol with secret circular shift for k-NN search,? IEEE Trans. Inf. Forensics Secur., vol. 8, no. 6, pp. 863?873, Jun.2013.
  20. L. Yiu, G. Ghinita, C. S. Jensen, and P. Kalnis, ?Enabling search services on outsourced private spatial data,? VLDB J., vol. 19, no. 3, pp. 363?384,2010.
  21. Shi, J. Bethencourt, T.-H. Chan, D. Song, and A. Perrig, ?Multi- dimensional range query over encrypted data,? in Proc. IEEE Symp. Secur. & Privacy, 2007, pp.350?364.
  22. Wang, Y. Hou, M. Li, H. Wang, and H. Li, ?Maple: Scalable multi- dimensional range search over encrypted cloud data withtree-based index,? in Proc. 9th ACM Symp. Inf. Comput. Commun. Secur.,2014, pp.111?122.
  23. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, ?Order preserving encryption for numeric data,? in Proc. SIGMOD, 2004, pp.563?574.
  24. Shao, R. Lu, and X. Lin, ?Fine: A fine-grained privacy-preserving location-based service framework for mobile devices,? in Proc. IEEE INFOCOM, 2014, pp.244?252.
  25. Boldyreva, N. Chenette, Y. Lee, and A. Oneill, ?Order-preserving symmetric encryption,? in Proc. eurocrypt, 2009, pp.224?241.
  26. Wang and C. Ravishankar, ?Secure and efficient range queries on out- sourceddatabasesusingRp-trees,?inProc.Int.Conf.DataEng.(ICDE), 2013, pp.314?325.
  27. Beresford and F. Stajano, ?Location privacy in pervasive comput- ing,? Pervasive Comput., vol. 2, no. 1, pp. 46?55, Jan./Mar.2003.
  28. Zhu, D. Ma, D. Huang, and C. Hu, ?Enabling secure location-based services in mobile cloud computing,? in Proc. 2nd ACM SIGCOMM Workshop Mobile Cloud Comput., 2013, pp.27?32.
  29. Kido, Y. Yanagisawa, and T. Satoh, ?An anonymous communication techniqueusingdummiesforlocation-basedservices,?inProc.Int.Conf. Perv. Serv. (ICPS), 2005, pp.88?97.
  30. A. Ardagna, M. Cremonini, E. Damiani, S. D. C. Di Vimercati, and P. Samarati, ?Location privacy protection throughobfuscation-based techniques,? in Proc. Data Appl. Secur. XXI, 2007, pp.47?60.
  31. Gruteser and D. Grunwald, ?Anonymous usage of location-based services through spatial and temporal cloaking,? in Proc. 1st Int. Conf. Mobile Syst. Appl. Serv., 2003, pp.31?42.
  32. F. Mokbel, C.-Y.Chow, and W. G. Aref, ?The new Casper: Query processingforlocationserviceswithoutcompromisingprivacy,?inProc. 32nd Int. Conf. Very Large Data Bases (VLDB?06), 2006, pp.763?774.

[Gadipalli Bhavani and Vishwesh Nagamalla. (2019); SPATIAL LOCATION OF ASSURANCE WITH WITNESS OF MUTUAL PROOFS PROVIDING PRIVACY FOR MOBILE USERS. Int. J. of Adv. Res. 7 (Feb). 1050-1057] (ISSN 2320-5407). www.journalijar.com

srikanth

DOI:

Article DOI: 10.21474/IJAR01/8578      
DOI URL: https://dx.doi.org/10.21474/IJAR01/8578

Download Full Paper

Download PDF No. of Downloads: 14 | No. of Views: 48