Skip to main content
SpringerLink
Log in

Privacy-Preserving Ranked Searchable Encryption Based on Differential Privacy

  • Conference paper
  • First Online:
Quality, Reliability, Security and Robustness in Heterogeneous Systems (QShine 2021)

Abstract

Ranked search allows the cloud server to search the top-k most relevant documents according to the relevance score between query keyword and documents, which has been recognized as the most promising way to realize secure search over encrypted database. However, recent studies show that some privacy protection methods commonly used in ranked search, like order-preserving encryption (OPE), have some security problems. In this paper, we first propose a scheme, called privacy-preserving ranked searchable encryption based on differential privacy (DP-RSE). Specifically, we add noise drawn from a Laplace distribution into the relevance score to disturb its value. In this way, no matter how much background the adversary has, he (or she) cannot obtain the true relevance score or ranked order. Moreover, our scheme ensures the correctness of search results with high probability. The experiment results show that our scheme can achieve sub-linear efficiency and the accuracy of search results can reach 94%.

This work was supported by the National Natural Science Foundation of China (No: 62072240) and the National Key Research and Development Program of China (No. 2020YFB1804604).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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. Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order-preserving encryption for numeric data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 563–574. ACM, New York (2004)

    Google Scholar 

  2. Boldyreva, A., Chenette, N., Lee, Y., O’Neill, A.: Order-preserving symmetric encryption. In: Joux, A. (ed.) Advances in Cryptology - EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2009. LNCS, vol. 5479, pp. 224–241. Springer, Heidelberg (2009)

    Google Scholar 

  3. Cao, N., Wang, C., Li, M., Ren, K., Lou, W.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. In: 30th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, pp. 829–837. IEEE, New York (2011)

    Google Scholar 

  4. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79–88. ACM, New York (2006)

    Google Scholar 

  5. Ding, B., Kulkarni, J., Yekhanin, S.: Collecting telemetry data privately. In: Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems, pp. 3571–3580. Neural Information Processing System (2017)

    Google Scholar 

  6. Duchi, J.C., Jordan, M.I., Wainwright, M.J.: Local privacy and statistical minimax rates. CoRR abs/1302.3203 (2013). http://arxiv.org/abs/1302.3203

  7. Durak, F.B., DuBuisson, T.M., Cash, D.: What else is revealed by order-revealing encryption? In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1155–1166. ACM, New York (2016)

    Google Scholar 

  8. Dwork, C.: Differential Privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1–12. Springer, Heidelberg (2006). https://doi.org/10.1007/11787006_1

    Chapter  Google Scholar 

  9. Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3–4), 211–407 (2014)

    MathSciNet  MATH  Google Scholar 

  10. Erlingsson, Ú., Pihur, V., Korolova, A.: RAPPOR: randomized aggregable privacy-preserving ordinal response. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 1054–1067. ACM, New York (2014)

    Google Scholar 

  11. Friedman, A., Schuster, A.: Data mining with differential privacy. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 493–502. ACM, New York (2010)

    Google Scholar 

  12. Fuller, B., Varia, M., Yerukhimovich, A., et al.: Sok: cryptographically protected database search. In: 2017 IEEE Symposium on Security and Privacy, pp. 172–191. IEEE Computer Society, Washington (2017)

    Google Scholar 

  13. Goh, E.: Secure indexes. IACR Cryptol. ePrint Arch. 2003, 216 (2003). http://eprint.iacr.org/2003/216

  14. Grubbs, P., Lacharité, M., Minaud, B., Paterson, K.G.: Learning to reconstruct: statistical learning theory and encrypted database attacks. In: 2019 IEEE Symposium on Security and Privacy, pp. 1067–1083. IEEE Computer Society (2019)

    Google Scholar 

  15. Grubbs, P., Sekniqi, K., Bindschaedler, V., Naveed, M., Ristenpart, T.: Leakage-abuse attacks against order-revealing encryption. In: 2017 IEEE Symposium on Security and Privacy, pp. 655–672. IEEE Computer Society, Washington (2017)

    Google Scholar 

  16. Ji, Z., Lipton, Z.C., Elkan, C.: Differential privacy and machine learning: a survey and review. CoRR abs/1412.7584 (2014). http://arxiv.org/abs/1412.7584

  17. Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 965–976. ACM, New York (2012)

    Google Scholar 

  18. Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.D.: What can we learn privately? CoRR abs/0803.0924 (2008). http://arxiv.org/abs/0803.0924

  19. Kerschbaum, F., Schröpfer, A.: Optimal average-complexity ideal-security order-preserving encryption. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 275–286. ACM, New York (2014)

    Google Scholar 

  20. Lacharité, M., Minaud, B., Paterson, K.G.: Improved reconstruction attacks on encrypted data using range query leakage. In: 2018 IEEE Symposium on Security and Privacy, pp. 297–314. IEEE Computer Society, Washington (2018)

    Google Scholar 

  21. Li, K., Zhang, W., Yang, C., Yu, N.: Security analysis on one-to-many order preserving encryption-based cloud data search. IEEE Trans. Inf. Forensics Secur. 10(9), 1918–1926 (2015)

    Article  Google Scholar 

  22. Liu, Q., Tian, Y., Wu, J., Peng, T., Wang, G.: Enabling verifiable and dynamic ranked search over outsourced data. IEEE Trans. Serv. Comput. (2019). https://doi.org/10.1109/TSC.2019.2922177

    Article  Google Scholar 

  23. Onozawa, S., Kunihiro, N., Yoshino, M., Naganuma, K.: Inference attacks on encrypted databases based on order preserving assignment problem. In: Inomata, A., Yasuda, K. (eds.) IWSEC 2018. LNCS, vol. 11049, pp. 35–47. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97916-8_3

    Chapter  Google Scholar 

  24. Popa, R.A., Li, F.H., Zeldovich, N.: An ideal-security protocol for order-preserving encoding. In: 2013 IEEE Symposium on Security and Privacy, pp. 463–477. IEEE Computer Society, Washington (2013)

    Google Scholar 

  25. Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, pp. 44–55. IEEE Computer Society, Washington (2000)

    Google Scholar 

  26. Sun, W., Wang, B., Cao, N., et al.: Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking. IEEE Trans. Parallel Distrib. Syst. 25(11), 3025–3035 (2014)

    Article  Google Scholar 

  27. Wang, C., Cao, N., Li, J., Ren, K., Lou, W.: Secure ranked keyword search over encrypted cloud data. In: 2010 International Conference on Distributed Computing Systems, pp. 253–262. IEEE Computer Society, Washington (2010)

    Google Scholar 

  28. Wang, T., Ding, B., Zhou, J., et al.: Answering multi-dimensional analytical queries under local differential privacy. In: Proceedings of the 2019 International Conference on Management of Data, pp. 159–176. ACM, New York (2019)

    Google Scholar 

  29. Wei, K., et al.: Federated learning with differential privacy: algorithms and performance analysis. IEEE Trans. Inf. Forensics Secur. 15, 3454–3469 (2020)

    Article  Google Scholar 

  30. Xia, Z., Zhu, Y., Sun, X., Chen, L.: Secure semantic expansion based search over encrypted cloud data supporting similarity ranking. J. Cloud Comput. 3, 8 (2014)

    Article  Google Scholar 

  31. Yang, Y., Liu, X., Deng, R.H.: Multi-user multi-keyword rank search over encrypted data in arbitrary language. IEEE Trans. Depend. Secur. Comput. 17(2), 320–334 (2020)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nanjing University of Science and Technology, Nanjing, 210094, JS, China

    Yu Zhao, Chungen Xu, Lin Mei & Pan Zhang

Authors
  1. Yu Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chungen Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lin Mei
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chungen Xu .

Editor information

Editors and Affiliations

  1. Monash University, Clayton, VIC, Australia

    Xingliang Yuan

  2. School of Computer Science, University of Sydney, Camperdown, NSW, Australia

    Wei Bao

  3. RMIT University, Melbourne, VIC, Australia

    Xun Yi

  4. University of Sydney, Camperdown, NSW, Australia

    Nguyen Hoang Tran

Rights and permissions

Reprints and permissions

Copyright information

© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, Y., Xu, C., Mei, L., Zhang, P. (2021). Privacy-Preserving Ranked Searchable Encryption Based on Differential Privacy. In: Yuan, X., Bao, W., Yi, X., Tran, N.H. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Systems. QShine 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 402. Springer, Cham. https://doi.org/10.1007/978-3-030-91424-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-91424-0_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-91423-3

  • Online ISBN: 978-3-030-91424-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation