Privacy Preserving Location Based Spatial Range Query over SS-Tree Index Structure

Authors

  • T. Shirisha  Department of CSE, JNTUA college of Engineering. Ananthapuramu, Andhra Pradesh, India
  • C. Shoba Bindu  Department of CSE, JNTUA college of Engineering. Ananthapuramu, Andhra Pradesh, India
  • P. Dileep Kumar Reddy  

Keywords:

Outsourced encrypted data, privacy-enhancing technology, SPG (spatial range query), coordinate transformation suite, LBS (Location-based services).

Abstract

Based on IOT, the Location based services (LBS) and spatial range queries (SPG) have received great impact and became more popular and is absolutely needed in recent years. This leads to several issues such as increase in search latency, minimum numbers of queries for a user and known sample attacks. So, in order to overcome the issues in LBS, a coordinate transformation suite technique (CTS) based on ss-tree index structure has been proposed by Lichen et. al.,. They used Euclidean distance to calculate the distance between two locations. This paper replaces Euclidean distance with the great circle distance (GCD) to calculate the shortest distance between two locations. Using GCD in the scheme has increased the number of queries generated and the query latency has been decreased.

References

  1. A. Gutscher, "Coordinate transformation-A solution for the privacy problem of location based services?" in Proc. 20th Int. Parallel Distrib.
  2. Process. Symp. (IPDPS’06), Rhodes Island, Greece, Apr. 25–29, 2006, p. 424.
  3. A. R. Beresford and F. Stajano, "Location privacy in pervasive computing," Pervasive Comput., vol. 2, no. 1, pp. 46–55, Jan./Mar. 2003
  4. B. Wang, Y. Hou, M. Li, H. Wang, and H. Li, "Maple: Scalable multidimensional range search over encrypted cloud data with tree-based index," in Proc. 9th ACM Symp. Inf. Comput. Commun. Secur., 2014, pp. 111–122.
  5. C. A. Ardagna, M. Cremonini, E. Damiani, S. D. C. Di Vimercati, and P. Samarati, "Location privacy protection through obfuscation-based techniques," in  Proc. Data Appl. Secur. XXI, 2007, pp. 47–60.
  6. D. A. White and R. Jain, "Similarity indexing with the ss-tree," in Proc. 12th Int. Conf. Data Eng. (ICDE), 1996, pp. 516–523
  7. Lichuen Li, Rongxing Lu,, IEEE, Senior Member and Cheng Huang Efficient searching Privacy Preserving Location-Based Query Over Outsourced Encrypted Data", in proc.7th,2016,pp.322-422.
  8. M. 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.
  9. M. F. Mokbel, C.-Y. Chow, and W. G. Aref, "The new Casper: Query processing for location services without compromising privacy," in Proc.32nd Int. Conf. Very Large Data Bases (VLDB’06), 2006, pp. 763–774.
  10. X. 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
  11. Y. Elmehdwi, B. K. Samanthula, and W. Jiang, "Secure k-nearest neighbour query over encrypted data in outsourced environments," in Proc. IEEE 30th Int. Conf. Data Eng. (ICDE), 2014, pp. 664–675.
  12. Melia and Avenida, Madrid" LBS  geolocation" https://tmt.knect365.com/location-based-services /,Accessed on june 2, 2017.

Downloads

Published

2017-08-31

Issue

Section

Research Articles

How to Cite

[1]
T. Shirisha, C. Shoba Bindu, P. Dileep Kumar Reddy, " Privacy Preserving Location Based Spatial Range Query over SS-Tree Index Structure, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 4, pp.667-671, July-August-2017.