Privacy-Preserving Scheme for Nearest Life Services Search Based on Dummy Locations and Homomorphic Encryption Algorithm

  • Conference paper
  • First Online:
Advances in Internet, Data & Web Technologies (EIDWT 2023)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 161))

  • 419 Accesses

Abstract

With the rapid development of emerging internet technologies, Location Based Services (LBS) have brought great convenience to the people’s lives. However the locations will be exposed to service providers posing serious threats to users’ information security. No trusted entities except the user himself as a basic assumption, This paper proposes a privacy-preserving the nearest life services search scheme with cloud server instead of LBS provider, which the user and the life service providers both do not need to provide their actual locations to the cloud server. First, the user constructs a K-anonymous area composed of all dummy locations. The relevant life service providers respond according to the distance to the dummy address. Then, with the computing and communication assist of the cloud server which is based on homomorphic properties of Paillier cryptosystem, the user finds and connects to the nearest life service provider. Our scheme not only reduces the cost of communication between users and servers but also protects the location and track information, which achieves trade-off of privacy and availability in mobile web applications, it can also be used as a business model applicable to any location-based service industry.

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

Access this chapter

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 234.33
Price includes VAT (France)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 295.39
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zhang, X.J., Gui, X.L., Wu, Z.D.: Privacy preservation for location based services: a survey. Ruan Jian Xue Bao/J. Softw. 26(9), 2373–2395 (2015). https://doi.org/10.13328/j.cnki.jos.004857. (in Chinese with English abstract). http://www.jos.org.cn/1000.9825/4857.htm

  2. Gao, S., Ma, J.F., Yao, Q.S., Sun, C.: Towards cooperation location privacy-preserving group nearest neighbor queries in LBS. J. Commun. 36(3), 146–154 (2015). (in Chinese with English abstract)

    Google Scholar 

  3. Niu, B., Zhang, Z., Li, X., et al.: Privacy-area aware dummy generation algorithms for location-based services. In: Proceedings of the 2014 IEEE International Conference on Communications (ICC), pp. 957–962. IEEE (2014)

    Google Scholar 

  4. Gong, Z., Sun, G.Z., **e, X.: Protecting privacy in location-based services using k-anonymity without cloaked region. In: Proceedings of the 2010 11th International Conference on Mobile Data Management (MDM), pp. 366–371. IEEE (2010)

    Google Scholar 

  5. Bendlin, R., Damgård, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169–188. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20465-4_11

    Chapter  Google Scholar 

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

    Google Scholar 

  7. Zhao, H., Yi, X., Wan, J.: Privacy-area aware all-dummy-based location privacy algorithms for location-based services. In: The International Conference on Artificial Intelligence and Computer Engineering (2016)

    Google Scholar 

  8. Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)

    Google Scholar 

  9. Lin, H.-Y., Tzeng, W.-G.: An efficient solution to the millionaires’ problem based on homomorphic encryption. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 456–466. Springer, Heidelberg (2005). https://doi.org/10.1007/11496137_31

    Chapter  Google Scholar 

  10. Li, J., Wang, Q., Wang, C., et al.: Fuzzy keyword search over encrypted data in cloud computing. In: Proceedings of the Conference on Information Communications, pp. 441–445. IEEE Press (2010)

    Google Scholar 

  11. Wang, C.N., Li, C., Ren, M., Lou, W.K.: Privacy preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 25(1), 222–233 (2014)

    Article  Google Scholar 

  12. Yi, X., Paulet, R., Bertino, E., et al.: Practical approximate k nearest neighbor queries with location and query privacy. IEEE Trans. Knowl. Data Eng. 28(6), 1546–1559 (2016)

    Article  Google Scholar 

  13. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48910-X_16

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Li** Shi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, T., Shi, L. (2023). Privacy-Preserving Scheme for Nearest Life Services Search Based on Dummy Locations and Homomorphic Encryption Algorithm. In: Barolli, L. (eds) Advances in Internet, Data & Web Technologies. EIDWT 2023. Lecture Notes on Data Engineering and Communications Technologies, vol 161. Springer, Cham. https://doi.org/10.1007/978-3-031-26281-4_18

Download citation

Publish with us

Policies and ethics

Navigation