Privacy Preserving in Cloud Environment for Obstructed Shortest Path Query | Wireless Personal Communications Skip to main content
Springer Nature Link
Log in

Privacy Preserving in Cloud Environment for Obstructed Shortest Path Query

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

With the prosperity of location-based services, shortest path query became one of the most common services, and provided convenience for finding the best way to arrive at the destination of users. However, in order to obtain the service, users had to submit the current locations to a data owner, and this process may pose privacy threats to users. More seriously, if the data owner outsourcing the query data to a cloud server for calculating the shortest distance, users’ privacy may be leaked even further. To cope with the problem of outsourcing computation, based the homomorphic encryption and secure multiparty computation, this manuscript presents a framework to reduce the likelihood of private information leakage, and privacy preservation of both the user, and the data owner. In this framework, two different conditions were considered, and the shortest path was computed with or without obstruction on the road. Thereafter, two protocols called “query with obstruction” and “query without obstruction” are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Ghinita, G., Kalnis, P., Kantarcioglu, M., et al. (2011). Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection. GeoInformatica, 15(4), 699–726.

    Article  Google Scholar 

  2. Yi, X., Paulet, R., Bertino, E., et al. (2014). Practical k nearest neighbor queries with location privacy. In Proceedings of 30th International Conference on Data Engineering (ICDE), 2014 IEEE (pp. 640–651).

  3. Lee, K.C.K., Lee, W.C., Leong, H.V., et al. (2009). Navigational path privacy protection: Navigational path privacy protection. In Proceedings of the 18th ACM conference on Information and Knowledge Management, ACM, 2009 (pp. 691–700).

  4. Mouratidis, K., & Yiu, M. L. (2012). Shortest path computation with no information leakage. Proceedings of the VLDB Endowment, 5(8), 692–703.

    Article  Google Scholar 

  5. Xi, Y., Schwiebert, L., & Shi, W. (2014). Privacy preserving shortest path routing with an application to navigation. Pervasive & Mobile Computing, 13(4), 142–149.

    Article  Google Scholar 

  6. Elmehdwi, Y., Samanthula, B.K., Wei, J. (2013). Secure k-nearest neighbor query over encrypted data in outsourced environments. In Proceedings of 30th International Conference on Data Engineering (ICDE), 2014 IEEE (pp. 664–675).

  7. Choi, S., Ghinita, G., Lim, H. S., et al. (2014). Secure kNN query processing in untrusted cloud environments. IEEE Transactions on Knowledge and Data Engineering, 26(11), 2818–2831.

    Article  Google Scholar 

  8. Zhang, Y., Su, S., Chen, W., et al. (2013). Privacy-preserving shortest distance computing in cloud environment. Journal of Huazhong University of Science & Technology.

  9. Gao, J., Yu, J. X., Jin, R., et al. (2013). Outsourcing shortest distance computing with privacy protection. The VLDB Journal—The International Journal on Very Large Data Bases, 22(4), 543–559.

    Article  Google Scholar 

  10. Gruteser, M., Grunwald, D. (2003). Anonymous usage of location-based services through spatial and temporal cloaking. In Proceedings of the 1st International Conference on Mobile Systems, Applications and Services, ACM (pp. 31–42).

  11. Machanavajjhala, A., Gehrke, J., & Kifer, D. (2007). l-diversity: Privacy beyond k-anonymity. Acm Transactions on Knowledge Discovery from Data, 1(1), 24.

    Article  Google Scholar 

  12. Li, N., Li, T., Venkatasubramanian, S. (2007). t-closeness: Privacy beyond k-anonymity and l-diversity. In Proceedings of 23rd International Conference on Data Engineering, ICDE 2007, IEEE (pp. 106–115).

  13. Wang, E. K., & Ye, Y. (2014). A new privacy-preserving scheme for continuous query in location-based social networking services. International Journal of Distributed Sensor Networks, 2014(1), 1–11.

    Google Scholar 

  14. Pan, X., Xu, J., & Meng, X. (2012). Protecting location privacy against location-dependent attacks in mobile services. IEEE Transactions on Knowledge and Data Engineering, 24(8), 1506–1519.

    Article  Google Scholar 

  15. Hashem, T., Kulik, L., & Zhang, R. (2013). Countering overlapping rectangle privacy attack for moving kNN queries. Information Systems, 38(3), 430–453.

    Article  Google Scholar 

  16. Talukder, N., & Ahamed, S.I. (2010). Preventing multi-query attack in location-based services. In Proceedings of the Third ACM Conference on Wireless Network Security, ACM (pp. 25–36).

  17. Ghinita, G., Kalnis, P., Khoshgozaran, A., et al. (2008). Private queries in location based services: Anonymizers are not necessary. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, ACM (pp. 121–132).

  18. Khoshgozaran, A., Shirani-Mehr, H., Shahabi, C. (2008). Spiral: A scalable private information retrieval approach to location privacy. In Proceedings of Ninth International Conference on Mobile Data Management Workshops, MDMW 2008, IEEE (pp. 55–62).

  19. Khoshgozaran, A., Shahabi, C., & Shirani-Mehr, H. (2011). Location privacy: going beyond K-anonymity, cloaking and anonymizers. Knowledge and Information Systems, 26(3), 435–465.

    Article  Google Scholar 

  20. Paulet, R., Koasar, M.G., Yi, X., et al. Privacy-preserving and content-protecting location based queries. In Proceedings of 28th International Conference on Data Engineering (ICDE), 2012, IEEE (pp. 44–53).

  21. Yi, X., Paulet, R., Bertino, E., et al. Practical k nearest neighbor queries with location privacy. In Proceedings of 30th International Conference on Data Engineering (ICDE), 2014 IEEE (pp. 640–651).

  22. Lien, I. T., Lin, Y. H., Shieh, J. R., et al. (2013). A novel privacy preserving location-based service protocol with secret circular shift for k-NN search. IEEE Transactions on Information Forensics and Security, 8(6), 863–873.

    Article  Google Scholar 

  23. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M. (1995). Private information retrieval. In FOCS (pp. 41–50).

  24. Šedšnka, J., Gasti, P. (2014). Privacy-preserving distance computation and proximity testing on earth, done right. In Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, ACM (pp. 99–110).

  25. Paillier, P. (1999). Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology: EUROCRYPT’99. Berlin: Springer (pp. 223–238).

  26. Zhu, H., Wang, J., Wang, B., et al. (2014). Location privacy preserving obstructed nearest neighbor queries. Journal of Computer Research & Development, 51(1), 115–125.

    Google Scholar 

  27. Zhang, L., Li, J., Wang, B. (2015). Privacy preserving in un-trusted cloud environments for query shortest path. In Proceedings of International Conference on Applied Science and Engineering Innovation. WOS: 000375708200111.

  28. Tzeng, W. G. (2004). Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters. IEEE Transactions on Computers, 53(2), 232–240.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We would like to present our thanks to anonymous reviewers for their helpful suggestions. This work was supported by Jiamusi university of science and technology research key project (Project Number: Lz2013-011), Jiamusi university of science and technology research youth fund projects(project number: Lq2013-033), Natural Science Foundation of Heilongjiang Province of China (Project Number: F2015022), The youth program of national natural science fund (Project Number: 61203052).

Author information

Authors and Affiliations

  1. College of Information and Electronic Technology, Jiamusi University, Jiamusi, 154007, China

    Lei Zhang, Jing Li, Songtao Yang & Bin Wang

Authors
  1. Lei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Songtao Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jing Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, L., Li, J., Yang, S. et al. Privacy Preserving in Cloud Environment for Obstructed Shortest Path Query. Wireless Pers Commun 96, 2305–2322 (2017). https://doi.org/10.1007/s11277-017-4299-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4299-8

Keywords

Search

Navigation