Skip to main content
Springer Nature Link
Log in

Conjunctive Keywords Searchable Encryption Scheme Against Inside Keywords Guessing Attack from Lattice

  • Conference paper
  • First Online:
Artificial Intelligence and Security (ICAIS 2020)

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

Included in the following conference series:

Abstract

Public-key encryption with conjunctive keywords search (PECKS) is an extension of public-key encryption with keywords search (PEKS), which can realize the efficient search of the encrypted data stored in the cloud server and keep the privacy of these data during the search phase. However, there exists an inherent security issue for the typical PEKS schemes that they cannot prevent the inside keywords guessing attack (KGA). Moreover, most PEKS schemes were constructed based on the hardness of some number theory problems which can be solved in polynomial time using the quantum computer. Thus once large-scale quantum computers are built, these PEKS schemes aren’t secure in the future quantum era. To address the above issues, this paper proposes a lattice-based PECKS scheme which can resist inside KGA. Its security can be reduced to the hardness of LWE problem and ISIS problem, thus it can resist quantum computing attack. We also give a comparison with other searchable encryption schemes on the computational cost of the main algorithms and the size of related parameters.

The authors would like to thank the support from Fundamental Research Funds for the Central Universities (No. 30918012204), China. The authors also gratefully acknowledge the helpful comments and suggestions of other researchers, which has improved the presentation.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

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: Proceedings of the ICALP, pp. 1–9 (1999)

    Google Scholar 

  3. Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: Proceedings of the STACS, pp. 75–86 (2009)

    Google Scholar 

  4. Behnia, R., Ozmen, M.O., Yavuz, A.A.: Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans. Dependable Secure Comput. (2018). https://doi.org/10.1109/TDSC.2018.2867462

    Article  Google Scholar 

  5. 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 

  6. Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: TCC, pp. 535–554 (2007)

    Google Scholar 

  7. Byun, J.W., Rhee, H.S., Park, H., Lee, D.H.: Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Secure Data Management, Third VLDB Workshop, SDM, pp. 75–83 (2006)

    Google Scholar 

  8. Chen, R., Mu, Y., Yang, G., Guo, F., Wang, X.: A new general framework for secure public key encryption with keyword search. In: ACISP, pp. 59–76 (2015)

    Google Scholar 

  9. Farràs, O., Ribes-González, J.: Provably secure public-key encryption with conjunctive and subset keyword search. Int. J. Inf. Secur. 18(5), 533–548 (2019). https://doi.org/10.1007/s10207-018-00426-7

    Article  Google Scholar 

  10. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 197–206 (2008)

    Google Scholar 

  11. Gu, C., Zheng, Y., Kang, F., Xin, D.: Keyword search over encrypted data in cloud computing from lattices in the standard model. In: Cloud Computing and Big Data - Second International Conference, CloudCom-Asia, pp. 335–343 (2015)

    Google Scholar 

  12. Huang, Q., Li, H.: An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf. Sci. 403, 1–14 (2017)

    Article  Google Scholar 

  13. Kuchta, V., Markowitch, O.: Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices. In: Mycrypt. Malicious and Exploratory Cryptology, pp. 409–435 (2016)

    Google Scholar 

  14. Liu, Y., Peng, H., Wang, J.: Verifiable diversity ranking search over encrypted outsourced data. Comput. Mater. Continua 55(1), 37–57 (2018)

    Article  Google Scholar 

  15. 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(11), e3531 (2018). https://doi.org/10.1002/ett.3531

    Article  Google Scholar 

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

    Google Scholar 

  17. Rhee, H.S., Park, J.H., Susilo, W., Lee, D.H.: Trapdoor security in a searchable public-key encryption scheme with a designated tester. J. Syst. Softw. 83(5), 763–771 (2010)

    Article  Google Scholar 

  18. Sun, L., Xu, C., Zhang, M., Chen, K., Li, H.: Secure searchable public key encryption against insider keyword guessing attacks from indistinguishability obfuscation. SCIENCE CHINA Inf. Sci. 61(3), 038106:1–038106:3 (2018)

    Google Scholar 

  19. Tang, Y., Lian, H., Zhao, Z., Yan, X.: A proxy re-encryption with keyword search scheme in cloud computing. Comput. Mater. Continua 56(2), 339–352 (2018)

    Google Scholar 

  20. Xu, L., Xu, C., Liu, Z., Wang, Y., Wang, J.: Enabling comparable search over encrypted data for IoT with privacy-preserving. Comput. Mater. Continua 60(2), 675–690 (2019)

    Article  Google Scholar 

  21. 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, pp. 122–133 (2019)

    Google Scholar 

  22. Yang, Y., Ma, M.: Conjunctive keyword search with designated tester and timing enabled proxy re-encryption function for e-health clouds. IEEE Trans. Inf. Forensics Secur. 11(4), 746–759 (2016)

    Google Scholar 

  23. Yang, Y., Zheng, X., Chang, V., Ye, S., Tang, C.: Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud. Multimed. Tools Appl. 77, 1–15 (2018)

    Article  Google Scholar 

  24. Zhang, B., Zhang, F.: An efficient public key encryption with conjunctive-subset keywords search. J. Netw. Comput. Appl. 34(1), 262–267 (2011)

    Article  Google Scholar 

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

    Article  Google Scholar 

  26. Zhang, X., Xu, C., Mu, L., Zhao, J.: Identity-based encryption with keyword search from lattice assumption. China Commun. 15(4), 164–178 (2018)

    Article  Google Scholar 

  27. 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. Dependable Secure Comput. (2019). https://doi.org/10.1109/TDSC.2019.2914117

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Xiaoling Yu, Chungen Xu & Bennian Dou

Authors
  1. Xiaoling Yu
    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. Bennian Dou
    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. Nanjing University of Information Science, Nanjing, China

    Xingming Sun

  2. Nanjing University of Information Science, Nanjing, China

    Jinwei Wang

  3. Purdue University, West Lafayette, IN, USA

    Elisa Bertino

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yu, X., Xu, C., Dou, B. (2020). Conjunctive Keywords Searchable Encryption Scheme Against Inside Keywords Guessing Attack from Lattice. In: Sun, X., Wang, J., Bertino, E. (eds) Artificial Intelligence and Security. ICAIS 2020. Lecture Notes in Computer Science(), vol 12239. Springer, Cham. https://doi.org/10.1007/978-3-030-57884-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57884-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-57883-1

  • Online ISBN: 978-3-030-57884-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation