Skip to main content

Forward Secure Searchable Encryption with Conjunctive-Keyword Supporting Multi-user

  • Conference paper
  • First Online:
Security and Privacy in New Computing Environments (SPNCE 2020)

Abstract

Searchable symmetric encryption (SSE) enables users to efficiently search ciphertext in the cloud and ensures the security of encrypted data. Recent works show that forward security is an important property in dynamic SSE. Many forward secure searchable symmetric encryption (FSSE) schemes supporting single-keyword search have been proposed. Only a few SSE schemes can satisfy the forward security and support conjunctive keyword search at the same time, which are realized by adopting inefficient or complicated cryptography tools. Very recently, Hu proposed a novel construction to achieve conjunctive-keyword search, that is, using inner-product encryption (IPE) to design a conjunctive-keyword FSSE scheme. However, IPE scheme is a conceptually complex and low efficient scheme. In this paper, we use a more efficient cryptographic tool, asymmetric scalar-product-preserving encryption (ASPE), to design an efficient and secure conjunctive-keyword FSSE scheme. To improve practicality, we design our scheme to support multi-user setting. Our scheme achieves sub-linear efficiency, and can easily be used in any single-keyword FSSE scheme to obtain a conjunctive-keyword FSSE scheme supporting multi-user. Compared with the current conjunctive-keyword FSSE scheme, our scheme has a better update and search efficiency.

This work was supported in part by the Fundamental Research Funds for the Central Universities (No. 30918012204).

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bost, R.: \(\Sigma \) o\(\varphi \)o\(\varsigma \): Forward secure searchable encryption. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. pp. 1143–1154 (2016)

    Google Scholar 

  2. Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. pp. 1465–1482 (2017)

    Google Scholar 

  3. Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Annual Cryptology Conference. pp. 353–373. Springer (2013)

    Google Scholar 

  4. Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. Journal of Computer Security 19(5), 895–934 (2011)

    Article  Google Scholar 

  5. Goh, E.J., et al.: Secure indexes. IACR Cryptology ePrint Archive 2003, 216 (2003)

    Google Scholar 

  6. Golle, P., Staddon, J., Waters, B.: Secure conjunctive keyword search over encrypted data. In: International Conference on Applied Cryptography and Network Security. pp. 31–45. Springer (2004)

    Google Scholar 

  7. Hu, C., Song, X., Liu, P., Xin, Y., Xu, Y., Duan, Y., Hao, R.: Forward secure conjunctive-keyword searchable encryption. IEEE Access 7, 35035–35048 (2019)

    Article  Google Scholar 

  8. Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: International Conference on Financial Cryptography and Data Security. pp. 258–274. Springer (2013)

    Google Scholar 

  9. 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 (2012)

    Google Scholar 

  10. Kim, S., Lewi, K., Mandal, A., Montgomery, H., Roy, A., Wu, D.J.: Function-hiding inner product encryption is practical. In: International Conference on Security and Cryptography for Networks. pp. 544–562. Springer (2018)

    Google Scholar 

  11. Lai, S., Patranabis, S., Sakzad, A., Liu, J.K., Mukhopadhyay, D., Steinfeld, R., Sun, S.F., Liu, D., Zuo, C.: Result pattern hiding searchable encryption for conjunctive queries. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. pp. 745–762 (2018)

    Google Scholar 

  12. Lin, W., Wang, K., Zhang, Z., Chen, H.: Revisiting security risks of asymmetric scalar product preserving encryption and its variants. In: 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS). pp. 1116–1125. IEEE (2017)

    Google Scholar 

  13. Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000. pp. 44–55. IEEE (2000)

    Google Scholar 

  14. Song, X., Dong, C., Yuan, D., Xu, Q., Zhao, M.: Forward private searchable symmetric encryption with optimized i/o efficiency. IEEE Transactions on Dependable and Secure Computing (2018)

    Google Scholar 

  15. Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. NDSS. 71, 72–75 (2014)

    Google Scholar 

  16. Wang, Y., Wang, J., Sun, S., Miao, M., Chen, X.: Toward forward secure sse supporting conjunctive keyword search. IEEE Access 7, 142762–142772 (2019)

    Article  Google Scholar 

  17. Wong, W.K., Cheung, D.W.l., Kao, B., Mamoulis, N.: Secure knn computation on encrypted databases. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. pp. 139–152 (2009)

    Google Scholar 

  18. Xu, L., Xu, C., Liu, Z., Wang, Y., Wang, J.: Enabling comparable search over encrypted data for iot with privacy-preserving. Cmc-computers Materials & Continua 109(2), 537–554 (2019)

    Google Scholar 

  19. Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: The power of file-injection attacks on searchable encryption. In: 25th \(\{\)USENIX\(\}\) Security Symposium (\(\{\)USENIX\(\}\) Security 16). pp. 707–720 (2016)

    Google Scholar 

  20. Zhang, Z., Wang, J., Wang, Y., Su, Y., Chen, X.: Towards efficient verifiable forward secure searchable symmetric encryption. In: European Symposium on Research in Computer Security. pp. 304–321. Springer (2019)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chungen Xu .

Editor information

Editors and Affiliations

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

Liu, Z., Xu, C., Yao, Z. (2021). Forward Secure Searchable Encryption with Conjunctive-Keyword Supporting Multi-user. In: Wang, D., Meng, W., Han, J. (eds) Security and Privacy in New Computing Environments. SPNCE 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 344. Springer, Cham. https://doi.org/10.1007/978-3-030-66922-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-66922-5_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-66921-8

  • Online ISBN: 978-3-030-66922-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics