Skip to main content
SpringerLink
Log in
Book cover

International Conference on Network and System Security

NSS 2022: Network and System Security pp 712–726Cite as

An Efficient Lattice-Based Encrypted Search Scheme with Forward Security

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13787))

Abstract

Public-key encryption with keywords search (PEKS) can realize the retrieval of ciphertext data, which is a vital cryptographic primitive in the field of cloud storage. However, in practical applications, the secret keys of users are often exposed due to careless store or computer attacks, which causes privacy disclosure. Furthermore, considering the attack from quantum computers, this paper designs a lattice-based PEKS scheme with forward security which can reduce the damage from key exposure. Different from previous schemes, this scheme combines the binary tree structure and lattice basis extension algorithm to achieve the one-way key evolution mechanism which allows data users to update their secret keys periodically. Thus, the security of the scheme can be still guaranteed when the secret keys are exposed. Moreover, with the update of secret keys, data users’ public keys in our construction are fixed, which helps to save storage cost further, while public key in other existing scheme changes along with the update. Theoretic analysis shows that our scheme is more efficient when compared with the previous scheme.

This is a preview of subscription content, 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   89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.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

Learn about institutional subscriptions

References

  1. Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 98–115. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14623-7_6

    Chapter  MATH  Google Scholar 

  2. Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1–9. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48523-6_1

    Chapter  Google Scholar 

  3. Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS, Freiburg, Germany, vol. 3, pp. 75–86 (2009)

    Google Scholar 

  4. Anderson, R.: Two remarks on public key cryptology. Technical report, Computer Laboratory, University of Cambridge (2002)

    Google Scholar 

  5. Baek, J., Vu, Q.H., Shoufan, A., Jones, A., Wong, D.S.: Stateful public-key encryption schemes forward-secure against state exposure. Comput. J. 56(4), 497–507 (2013)

    Article  Google Scholar 

  6. Behnia, R., Ozmen, M.O., Yavuz, A.A.: Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans. Depend. Secur. Comput. 17(6), 1269–1282 (2020)

    Article  Google Scholar 

  7. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24676-3_30

    Chapter  Google Scholar 

  8. Bost, R.: \(\sum \)o\(\varphi \)o\(\varsigma \): forward secure searchable encryption. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, pp. 1143–1154 (2016)

    Google Scholar 

  9. Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255–271. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-39200-9_16

    Chapter  Google Scholar 

  10. Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523–552. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_27

    Chapter  Google Scholar 

  11. Dodis, Y., Katz, J., Xu, S., Yung, M.: Key-insulated public key cryptosystems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 65–82. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-46035-7_5

    Chapter  Google Scholar 

  12. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, pp. 197–206 (2008)

    Google Scholar 

  13. Gu, C., Zheng, Y., Kang, F., Xin, D.: Keyword search over encrypted data in cloud computing from lattices in the standard model. In: Qiang, W., Zheng, X., Hsu, C.-H. (eds.) CloudCom-Asia 2015. LNCS, vol. 9106, pp. 335–343. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-28430-9_25

    Chapter  Google Scholar 

  14. Kuchta, V., Markowitch, O.: Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices. In: Phan, R.C.-W., Yung, M. (eds.) Mycrypt 2016. LNCS, vol. 10311, pp. 409–435. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61273-7_20

    Chapter  Google Scholar 

  15. Le, H.Q., et al.: Lattice blind signatures with forward security. In: Liu, J.K., Cui, H. (eds.) ACISP 2020. LNCS, vol. 12248, pp. 3–22. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-55304-3_1

    Chapter  Google Scholar 

  16. Ling, S., Nguyen, K., Wang, H., Xu, Y.: Forward-secure group signatures from lattices. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 44–64. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25510-7_3

    Chapter  Google Scholar 

  17. Liu, J.K., Yuen, T.H., Zhou, J.: Forward secure ring signature without random oracles. In: Qing, S., Susilo, W., Wang, G., Liu, D. (eds.) ICICS 2011. LNCS, vol. 7043, pp. 1–14. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25243-3_1

    Chapter  Google Scholar 

  18. Mao, Y., Fu, X., Guo, C., Wu, G.: Public key encryption with conjunctive keyword search secure against keyword guessing attack from lattices. Trans. Emerg. Telecommun. Technol. 30, 1–14 (2018)

    Google Scholar 

  19. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1–34:40 (2009)

    Google Scholar 

  20. Xu, L., Yuan, X., Steinfeld, R., Wang, C., Xu, C.: Multi-writer searchable encryption: an LWE-based realization and implementation. In: Asia Conference on Computer and Communications Security, AsiaCCS, Auckland, New Zealand, pp. 122–133 (2019)

    Google Scholar 

  21. Xu, L., Yuan, X., Zhou, Z., Wang, C., Xu, C.: Towards efficient cryptographic data validation service in edge computing. In: IEEE World Congress on Services, SERVICES, Barcelona, Spain, 10–16 July 2022, p. 14 (2022)

    Google Scholar 

  22. Yang, Y., Zheng, X., Chang, V., Ye, S., Tang, C.: Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud. Multimedia Tools Appl. 77, 9927–9941 (2018). https://doi.org/10.1007/s11042-017-4560-x

    Article  Google Scholar 

  23. Zeng, M., Qian, H., Chen, J., Zhang, K.: Forward secure public key encryption with keyword search for outsourced cloud storage. IEEE Trans. Cloud Comput. 10(1), 426–438 (2022)

    Article  Google Scholar 

  24. Zhang, X., Tang, Y., Wang, H., Xu, C., Miao, Y., Cheng, H.: Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage. Inf. Sci. 494, 193–207 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  25. Zhang, X., Xu, C.: Trapdoor security lattice-based public-key searchable encryption with a designated cloud server. Wirel. Pers. Commun. 100(3), 907–921 (2018)

    Article  Google Scholar 

  26. Zhang, X., Xu, C., Wang, H., Zhang, Y., Wang, S.: FS-PEKS: lattice-based forward secure public-key encryption with keyword search for cloud-assisted industrial internet of things. IEEE Trans. Depend. Secur. Comput. 18(3), 1019–1032 (2021)

    Google Scholar 

Download references

Acknowledgment

The authors would like to thank the support from Fundamental Research Program of Shanxi Province (No. 20210302124273, No. 20210302123130), Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi (No. 2021L038), Shanxi Scholarship Council of China 2021-038, National Natural Science Foundation of China (No. 62072240, No. 62202228), Natural Science Foundation of Jiangsu Province under Grant (BK20210330), China. The authors also gratefully acknowledge the helpful comments and suggestions of other researchers, which has improved the presentation.

Author information

Authors and Affiliations

  1. College of Data Science, Taiyuan University of Technology, Taiyuan, China

    Xiaoling Yu & Xin Huang

  2. School of Mathematics and Statistics, Nanjing University of Science and Technology, Nanjing, China

    Lei Xu & Chungen Xu

Authors
  1. Xiaoling Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xin Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chungen Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lei Xu .

Editor information

Editors and Affiliations

  1. Monash University, Clayton, VIC, Australia

    Xingliang Yuan

  2. The University of Queensland, Queensland, QLD, Australia

    Guangdong Bai

  3. University of Malaga, Málaga, Spain

    Cristina Alcaraz

  4. Concordia University, Montreal, QC, Canada

    Suryadipta Majumdar

Rights and permissions

Reprints and permissions

Copyright information

© 2022 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

Yu, X., Xu, L., Huang, X., Xu, C. (2022). An Efficient Lattice-Based Encrypted Search Scheme with Forward Security. In: Yuan, X., Bai, G., Alcaraz, C., Majumdar, S. (eds) Network and System Security. NSS 2022. Lecture Notes in Computer Science, vol 13787. Springer, Cham. https://doi.org/10.1007/978-3-031-23020-2_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-23020-2_40

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-23019-6

  • Online ISBN: 978-3-031-23020-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation