Skip to main content

Privacy-Preserving Polynomial Evaluation over Spatio-Temporal Data on an Untrusted Cloud Server

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12681))

Included in the following conference series:

Abstract

Nowadays, with the popularity of location-aware devices, multifarious applications based on the spatio-temporal data come forth in our lives. In these applications, a platform (enterprise) collects the users’ spatio-temporal data based on which it recommends the top-k users (passengers) to the registered service providers (drivers). Outsourcing the tremendous scale of spatio-temporal data to cloud provides an economical way for the enterprises to implement their applications. In this paradigm, the third-party cloud server is not completely trustworthy. The collected spatio-temporal data can hold users’ privacy, so it’s a critical challenge to design a secure and efficient query mechanism for this scenario, such as the ride-hailing or the ride-sharing services. However, the existing solutions for the privacy-preserving kNN queries mainly focus on data privacy protection or computation complexity. There still lacks a practical privacy-preserving polynomial evaluation solution over the spatio-temporal data. In this paper, we propose a virtual road network structure to storage and index the spatio-temporal data in the road network and design a novel homomorphic encryption scheme based on Order-Revealing Encryption to enable an untrusted cloud server to execute the polynomial evaluation over the encrypted spatio-temporal data in the road network. We formally prove the security of the proposed scheme under the random oracle model. Extensive experiments on real world data demonstrate the effectiveness and efficiency of the proposed scheme over alternatives.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Wong, W.K., Cheung, D.W., Kao, B., Mamoulis, N.: Secure kNN computation on encrypted databases. In: SIGMOD, pp. 139–152 (2009)

    Google Scholar 

  2. Yao, B., Li, F., Xiao, X.: Secure nearest neighbor revisited. In: ICDE, pp. 733–744 (2013)

    Google Scholar 

  3. Choi, S., Ghinita, G., Lim, H.S., Bertino, E.: Secure kNN query processing in untrusted cloud environments. TKDE 26(11), 2818–2831 (2014)

    Google Scholar 

  4. Cui, N., Yang, X., et al.: SVkNN: efficient secure and verifiable k-nearest neighbor query on the cloud platform. In: ICDE, pp. 253–264 (2020)

    Google Scholar 

  5. Lei, X., Liu, A.X., Li, R., Tu, G.-H.: SecEQP: a secure and efficient scheme for SkNN query problem over encrypted geodata on cloud. In: ICDE (2019)

    Google Scholar 

  6. Rodrigo, A., Dayarathna, M., Jayasena, S.: Latency-aware secure elastic stream processing with homomorphic encryption. Data Sci. Eng. 4(3), 223–239 (2019). https://doi.org/10.1007/s41019-019-00100-5

    Article  Google Scholar 

  7. Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: ICDE, pp. 664–675 (2014)

    Google Scholar 

  8. Palanisamy, B., Liu, L.: MobiMix: protecting location privacy with mix-zones over road networks. In: ICDE, pp. 494–505 (2011)

    Google Scholar 

  9. Yi, X., Paulet, R., Bertino, E., Varadharajan, V.: Practical approximate k nearest neighbor queries with location and query privacy. TKDE 28(6), 1546–1559 (2016)

    Google Scholar 

  10. Paulet, R., Kaosar, M.G., Yi, X., Bertino, E.: Practical approximate k nearest neighbor queries with location and query privacy. TKDE 26(5), 1200–1210 (2014)

    Google Scholar 

  11. Yang, S., Tang, S., Zhang, X.: Privacy-preserving k nearest neighbor query with authentication on road networks. JPDC 134, 25–36 (2019)

    Google Scholar 

  12. Zeng, M., Zhang, K., Chen, J., Qian, H.: P3GQ: a practical privacy-preserving generic location-based services query scheme. PMC 51, 56–72 (2018)

    Google Scholar 

  13. Pham, A., Dacosta, I., et al.: PrivateRide: a privacy-enhanced ride-hailing service. Priv. Enhancing Technol. 2017(2), 38–56 (2017)

    Article  Google Scholar 

  14. Pham, A., Dacosta, I., et al. ORide: a privacy-preserving yet accountable ride-hailing service. In: USENIX Security, pp. 1235–1252 (2017)

    Google Scholar 

  15. Wang, F., Zhu, H., et al.: Efficient and privacy-preserving dynamic spatial query scheme for ride-hailing services. IEEE Trans. Veh. Technol. 67(11), 11084–11097 (2018)

    Article  Google Scholar 

  16. Sherif, A., Rabieh, K., et al.: Privacy-preserving ride sharing scheme for autonomous vehicles in big data era. IEEE Internet Things J. 4(2), 611–618 (2016)

    Article  Google Scholar 

  17. Li, M., Zhu, L., Lin, X.: Efficient and privacy-preserving carpooling using blockchain-assisted vehicular fog computing. IEEE Internet Things J. 6(3), 4573–4584 (2018)

    Article  Google Scholar 

  18. Song, W., Wang, B., Wang, Q., Shi, C., Lou, W., Peng, Z.: Publicly verifiable computation of polynomials over outsourced data with multiple sources. TIFS 12(10), 2334–2347 (2017)

    Google Scholar 

  19. Xu, Y., Tong, Y., Shi, Y., Tao, Q., Xu, K., Li, W.: An efficient insertion operator in dynamic ridesharing services. In: TKDE (2020)

    Google Scholar 

  20. Nabil, M., Sherif, A., et al.: Efficient and privacy-preserving ridesharing organization for transferable and non-transferable services. TDSC PP, 1 (2019)

    Google Scholar 

  21. Meng, X., Zhu, H., Kollios, G.: Top-k query processing on encrypted databases with strong security guarantees. In: ICDE, pp. 353–364 (2018)

    Google Scholar 

  22. Song, W., Shi, C., Shen, Y., Peng, Z.: Select the best for me: privacy-preserving polynomial evaluation algorithm over road network. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds.) DASFAA 2019. LNCS, vol. 11447, pp. 281–297. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-18579-4_17

    Chapter  Google Scholar 

  23. Lewi, K., Wu. D.J.: Order-revealing encryption: new constructions, applications, and bounds. In: CCS, pp. 1167–1178 (2016)

    Google Scholar 

  24. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792–807 (1986)

    Article  MathSciNet  Google Scholar 

  25. Samanthala, B.K., Chun, H., Jiang, W.: An efficient and probabilistic secure bit-decomposition. In: AsiaCCS, pp. 541–546 (2013)

    Google Scholar 

Download references

Acknowledgements

This work is partially supported by National Key Research and Development Project of China Nos. 2020YFC1522602, 2020AAA0107700, National Natural Science Foundation of China Nos. 62072349, U1811263, 61572378, 61822207, U20B2049, Technological Innovation Major Program of Hubei Province No. 2019AAA072, JSPS KAKENHI No.19K20269, and CCF-Tencent Open Fund WeBank Special Fund.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wei Song .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Song, W. et al. (2021). Privacy-Preserving Polynomial Evaluation over Spatio-Temporal Data on an Untrusted Cloud Server. In: Jensen, C.S., et al. Database Systems for Advanced Applications. DASFAA 2021. Lecture Notes in Computer Science(), vol 12681. Springer, Cham. https://doi.org/10.1007/978-3-030-73194-6_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-73194-6_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-73193-9

  • Online ISBN: 978-3-030-73194-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics