Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

Efficient and privacy-preserving location-based services over the cloud

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

The location-based services (LBS) scheme has become an essential part of people’s daily life, and it is widely used in various industries and cloud server applications. In LBS, users send the query regarding their current location to the cloud server. The cloud server collects the data related to the nearest hospital, restaurant, etc., corresponding to the received users’ query and sends them. If the cloud server is malicious, it may reveal sensitive information about the user. Therefore, users may hesitate to share their queries with the cloud server. Moreover, the cloud server wants to monetize its services, and it only provides data to the user for a prescribed fee. Hence, simultaneously achieving users’ query privacy and cloud server’s data privacy is an important goal in LBS. Existing LBS schemes have restrictions that they cannot simultaneously achieve these types of privacy at low computation costs. This work proposes three LBS schemes using the oblivious transfer (OT) protocol. The first LBS scheme provides user’s query privacy (in the presence of semi-honest cloud server) and cloud server’s data privacy; the other two provide user’s query privacy (in the presence of malicious cloud server) and cloud server’s data privacy. All the proposed schemes require significantly less exponentiation and modulus operations than existing LBS schemes. Experimental results showed that the proposed schemes required less execution time on average than the existing LBS schemes.

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
$34.99 /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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

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. Ashibani, Y., Mahmoud, Q.H.: Design and evaluation of a user authentication model for IoT networks based on app event patterns. Clust. Comput. 24(2), 837–850 (2021)

    Article  Google Scholar 

  2. Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Conference on the Theory and Application of Cryptology, pp. 547–557. Springer (1989)

  3. Bi, B., Huang, D., Mi, B., Deng, Z., Pan, H.: Efficient LBS security-preserving based on NTRU oblivious transfer. Wirel. Pers. Commun. 108(4), 2663–2674 (2019)

    Article  Google Scholar 

  4. Boneh, D.: The decision Diffie–Hellman problem. In: International Algorithmic Number Theory Symposium, pp. 48–63. Springer (1998)

  5. Brassard, G., Crépeau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Conference on the Theory and Application of Cryptographic Techniques, pp. 234–238. Springer (1986)

  6. Brassard, G., Crepeau, C., Robert, J.M.: Information theoretic reductions among disclosure problems. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 168–173. IEEE (1986)

  7. Chen, J., He, K., Yuan, Q., Chen, M., Du, R., Xiang, Y.: Blind filtering at third parties: an efficient privacy-preserving framework for location-based services. IEEE Trans. Mob. Comput. 17(11), 2524–2535 (2018)

    Article  Google Scholar 

  8. Demmler, D., Schneider, T., Zohner, M.: ABY—a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)

  9. Duan, M., Li, K., Liao, X., Li, K.: A parallel multiclassification algorithm for big data using an extreme learning machine. IEEE Trans. Neural Netw. Learn. Syst. 29(6), 2337–2351 (2017)

    Article  MathSciNet  Google Scholar 

  10. Duan, M., Li, K., Tang, Z., Xiao, G., Li, K.: Selection and replacement algorithms for memory performance improvement in spark. Concurr. Comput. Pract. Exp. 28(8), 2473–2486 (2016)

    Article  Google Scholar 

  11. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637–647 (1985)

    Article  MathSciNet  Google Scholar 

  12. Fersi, G.: Fog computing and Internet of Things in one building block: a survey and an overview of interacting technologies. Clust. Comput. 24, 1–31 (2021)

    Article  Google Scholar 

  13. Frederiksen, T.K., Keller, M., Orsini, E., Scholl, P.: A unified approach to MPC with preprocessing using OT. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 711–735. Springer (2015)

  14. Goldwasser, S.: How to play any mental game, or a completeness theorem for protocols with an honest majority. In: Proceedings of the Nineteenth Annual ACM STOC’87, pp. 218–229 (1987)

  15. 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, pp. 31–42 (2003)

  16. Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols: Techniques and Constructions. Springer, Heidelberg (2010)

    Book  Google Scholar 

  17. Hu, Q., Duan, M., Yang, Z., Yu, S., Xiao, B.: Efficient parallel secure outsourcing of modular exponentiation to cloud for IoT applications. IEEE Internet Things J. 8(16), 12782–12791 (2020)

    Article  Google Scholar 

  18. Huang, Y., Chapman, P., Evans, D.: Privacy-preserving applications on smartphones. In: HotSec (2011)

  19. Jannati, H., Bahrak, B.: An oblivious transfer protocol based on Elgamal encryption for preserving location privacy. Wirel. Pers. Commun. 97(2), 3113–3123 (2017)

    Article  Google Scholar 

  20. Li, B., Liang, R., Zhou, W., Yin, H., Gao, H., Cai, K.: LBS meets blockchain: an efficient method with security preserving trust in SAGIN. IEEE Internet Things J. (2021). https://doi.org/10.1109/JIOT.2021.3064357

    Article  Google Scholar 

  21. Li, X., Zhu, Y., Wang, J.: Highly efficient privacy preserving location-based services with enhanced one-round blind filter. IEEE Trans. Emerg. Top. Comput. 9(4), 1803–1814 (2019)

    Article  Google Scholar 

  22. Lindell, A.Y.: Efficient fully-simulatable oblivious transfer. In: Cryptographers’ Track at the RSA Conference, pp. 52–70. Springer (2008)

  23. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Proceedings of the Twelfth Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 448–457. Society for Industrial and Applied Mathematics (2001)

  24. Paulet, R., Kaosar, M.G., Yi, X., Bertino, E.: Privacy-preserving and content-protecting location based queries. IEEE Trans. Knowl. Data Eng. 26(5), 1200–1210 (2013)

    Article  Google Scholar 

  25. Rabin, M.: How to Exchange Secrets by Oblivious Transfer. Technical Report, TR-81. Harvard Aiken Computation Laboratory (1981)

  26. Slimani, S., Hamrouni, T., Charrada, F.B.: Service-oriented replication strategies for improving quality-of-service in cloud computing: a survey. Clust. Comput. 24(1), 361–392 (2021)

    Article  Google Scholar 

  27. Stern, J.P.: A new and efficient all-or-nothing disclosure of secrets protocol. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 357–371. Springer (1998)

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

    Article  MathSciNet  Google Scholar 

  29. uz Zaman, S.K., Jehangiri, A.I., Maqsood, T., Ahmad, Z., Umar, A.I., Shuja, J., Alanazi, E., Alasmary, W.: Mobility-aware computational offloading in mobile edge networks: a survey. Clust. Comput. 24, 1–22 (2021)

    Article  Google Scholar 

  30. Wang, S., Wang, X.S.: In-device spatial cloaking for mobile user privacy assisted by the cloud. In: 2010 Eleventh International Conference on Mobile Data Management, pp. 381–386. IEEE (2010)

  31. Yadav, V.K., Verma, S., Venkatesan, S.: Efficient and secure location-based services scheme in VANET. IEEE Trans. Veh. Technol. 69(11), 13567–13578 (2020)

    Article  Google Scholar 

  32. Yadav, V.K., Verma, S., Venkatesan, S.: Linkable privacy-preserving scheme for location-based services. IEEE Trans. Intell. Transp. Syst. (2021). https://doi.org/10.1109/TITS.2021.3074974

    Article  Google Scholar 

  33. Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162–167. IEEE (1986)

  34. Zheng, Y., Mei, W., Xiao, F.: Secure oblivious transfer protocol from indistinguishability obfuscation. J. China Univ. Posts Telecommun. 23(3), 1–10 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bennett University, Greater Noida, Uttar Pradesh, India

    Vijay Kumar Yadav, Shekhar Verma & S. Venkatesan

Authors
  1. Vijay Kumar Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shekhar Verma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Venkatesan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vijay Kumar Yadav.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yadav, V.K., Verma, S. & Venkatesan, S. Efficient and privacy-preserving location-based services over the cloud. Cluster Comput 25, 3175–3192 (2022). https://doi.org/10.1007/s10586-021-03533-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-021-03533-8

Keywords

Search

Navigation