Abstract
To cope with the local storage stress that has resulted from the increase in data volumes and to keep data privacy, users outsource their data to cloud servers after encrypting these data. Public key encryption with keyword search (PEKS) is a technique that can achieve the search function on encrypted data. However, most existing PEKS schemes are based on bilinear pairing which will be broken under the quantum computing attack. Moreover, the traditional PEKS schemes have an inherent security issue: They cannot resist the keywords guessing attack (KGA) which can cause devastating damage to the encrypted database. To address these problems, this paper proposes a KGA-resistance encrypted search scheme on lattice that is post-quantum secure. Furthermore, to achieve rich queries, our scheme is also designed to support the conjunctive query. Finally, the security analysis and performance evaluation are presented, which demonstrates that our scheme realizes a good balance between security and efficiency compared with related works.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
In our construction, we utilize the gadget matrix G at the following algorithms to reduce the sizes of parameters (Micciancio et al. 2012).
Here, we do not consider the exposure of secret key of the server.
References
Agrawal S, Boneh D, Boyen X (2010) Efficient lattice (H)IBE in the standard model. In: EUROCRYPT, pp 553–572
Ajtai M (1999) Generating hard instances of the short basis problem. In: ICALP, pp 1–9
Alwen J, Peikert C (2009) Generating shorter bases for hard random lattices. In: STACS, pp 75–86
Anada H, Kanaoka A, Matsuzaki N, Watanabe Y (2018) Key-updatable public-key encryption with keyword search: Models and generic constructions. In: ACISP, pp 341–359
Baek J, Safavi-Naini R, Susilo W (2008) Public key encryption with keyword search revisited. In: ICCSA, pp 1249–1259
Behnia R, Ozmen MO, Yavuz AA (2020) Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans Dependable Secur Comput 17(6):1269–1282
Boneh D, Crescenzo GD, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: EUROCRYPT, pp 506–522
Boneh D, Waters B (2007) Conjunctive, subset, and range queries on encrypted data. In: TCC, pp 535–554
Brakerski Z, Langlois A, Peikert C, Regev O, Stehlé D (2013) Classical hardness of learning with errors. In: STOC, pp 575–584
Byun JW, Rhee HS, Park H, Lee DH (2006) Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Secure Data Management, pp 75–83
Cash D, Hofheinz D, Kiltz E, Peikert C (2010) Bonsai trees, or how to delegate a lattice basis. In: EUROCRYPT, pp 523–552
Chen R, Mu Y, Yang G, Guo F, Wang X (2015) A new general framework for secure public key encryption with keyword search. In: ACISP, Springer, pp 59–76
Chen Z, Wu C, Wang D, Li S (2012) Conjunctive keywords searchable encryption with efficient pairing, constant ciphertext and short trapdoor. In: Intelligence and Security Informatics - Pacific Asia Workshop, PAISI, pp 176–189
Computer Security Division Information Technology Laboratory, N.T.U.: Post-quantum cryptography csrc, https://csrc.nist.gov/projects/post-quantum-cryptography (2017)
Crescenzo GD, Saraswat V (2007) Public key encryption with searchable keywords based on jacobi symbols. In: INDOCRYPT, pp 282–296
Fang L, Susilo W, Ge C, Wang J (2013) Public key encryption with keyword search secure against keyword guessing attacks without random oracle. Inf Sci 238:221–241
Farràs O, Ribes-González J (2019) Provably secure public-key encryption with conjunctive and subset keyword search. Int J Inf Sec 18(5):533–548
Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proc ACM symposium on theory of computing, pp 197–206
Gordon SD, Katz J, Vaikuntanathan V (2010) A group signature scheme from lattice assumptions. In: ASIACRYPT, pp 395–412
Gu C, Zheng Y, Kang F, Xin D (2015) Keyword search over encrypted data in cloud computing from lattices in the standard model. In: Cloud computing and big data, CloudCom-Asia, pp 335–343
Huang Q, Li H (2017) An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf Sci 403:1–14
Kuchta V, Markowitch O (2016) Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices. In: Mycrypt. Malicious and Exploratory Cryptology, pp 409–435
Ma S, Huang Q, Zhang M, Yang B (2015) Efficient public key encryption with equality test supporting flexible authorization. IEEE Trans Inf Forensics Secur 10(3):458–470
Mao Y, Fu X, Guo C, Wu G (2019) Public key encryption with conjunctive keyword search secure against keyword guessing attack from lattices. Trans Emerg Telecommun Technol 30(11)
Micciancio D, Peikert C (2012) Trapdoors for lattices: Simpler, tighter, faster, smaller. In: EUROCRYPT, pp 700–718
Park DJ, Kim K, Lee PJ (2004) Public key encryption with conjunctive field keyword search. In: Information Security Applications, WISA, pp 73–86
Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):34:1-34:40
Rhee HS, Park JH, Lee DH (2012) Generic construction of designated tester public-key encryption with keyword search. Inf Sci 205:93–109
Rhee HS, Park JH, Susilo W, Lee DH (2009) Improved searchable public key encryption with designated tester. In: ACM Symposium on Information, Computer and Communications Security, ASIACCS, pp 376–379
Rhee HS, Park JH, Susilo W, Lee DH (2010) Trapdoor security in a searchable public-key encryption scheme with a designated tester. J Syst Softw 83(5):763–771
Rompay CV, Molva R, Önen M (2018) Secure and scalable multi-user searchable encryption. In: Proceedings of the 6th international workshop on security in cloud computing, AsiaCCS, pp 15–25
Ryu E, Takagi T (2007) Efficient conjunctive keyword-searchable encryption. In: 21st international conference on advanced information networking and applications (AINA), pp 409–414
Song DX, Wagner DA, Perrig A (2000) Practical techniques for searches on encrypted data. In: IEEE symposium on security and privacy, pp 44–55
Sun W, Yu S, Lou W, Hou YT, Li H (2016) Protecting your right: verifiable attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. IEEE Trans Parallel Distrib Syst 27(4):1187–1198
Takagi T (2018) Recent developments in post-quantum cryptography. IEICE Trans 101–A(1):3–11
Wu DN, Gan Q, Wang X (2018) Verifiable public key encryption with keyword search based on homomorphic encryption in multi-user setting. IEEE Access 6:42445–42453
Xu L, Li J, Chen X, Li W, Tang S, Wu H (2019) Tc-pedcks: towards time controlled public key encryption with delegatable conjunctive keyword search for internet of things. J Netw Comput Appl 128:11–20
Xu L, Yuan X, Steinfeld R, Wang C, Xu C (2019) Multi-writer searchable encryption: An lwe-based realization and implementation. In: Asia conference on computer and communications security, AsiaCCS, pp 122–133
Xu P, Jin H, Wu Q, Wang W (2013) Public-key encryption with fuzzy keyword search: A provably secure scheme under keyword guessing attack. IEEE Trans Comput 62(11):2266–2277
Yang Y, Ma M (2016) 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
Yang Y, Zheng X, Chang V, Ye S, Tang C (2018) Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud. Multim Tools Appl 77(8):9927–9941
Zhang B, Zhang F (2011) An efficient public key encryption with conjunctive-subset keywords search. J Netw Comput Appl 34(1):262–267
Zhang X, Xu C (2018) Trapdoor security lattice-based public-key searchable encryption with a designated cloud server. Wirel Pers Commun 100(3):907–921
Zhang X, Xu C, Mu L, Zhao J (2018) Identity-based encryption with keyword search from lattice assumption. China Commun 15(4):164–178
Acknowledgements
This work is supported by Fundamental Research Program of Shanxi Province (No.20210302124273, No.20210302123130), Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi (No.2021L038), National Natural Science Foundation of China (No.62072240), Natural Science Foundation of Jiangsu Province under Grant (BK20210330), China. The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which has improved the presentation.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Informed consent
Informed consent was obtained from all individual participants included in the study.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Yu, X., Xu, C., Xu, L. et al. Hardening secure search in encrypted database: a KGA-resistance conjunctive searchable encryption scheme from lattice. Soft Comput 26, 11139–11151 (2022). https://doi.org/10.1007/s00500-022-07469-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-022-07469-y