{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T05:56:26Z","timestamp":1774936586265,"version":"3.50.1"},"reference-count":20,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T00:00:00Z","timestamp":1774569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>With the advancement in quantum computing technology, the number theory-based hard problems underlying traditional searchable encryption algorithms are now vulnerable to efficient quantum attacks. To address this challenge, this paper proposes Dilithium-PAEKS (Dilithium-Public Authenticated Encryption with Keyword Search), a searchable encryption scheme based on the post-quantum cryptographic algorithm CRYSTALS-Dilithium. By transforming the verification relationship of digital signatures into a matching relationship between trapdoors and ciphertexts, the scheme not only meets the functional requirements of searchable encryption but also demonstrates quantum resistance. The implementation enhances algorithm efficiency through keyword-based signatures and dynamic matching testing mechanisms. The security of the scheme is defined by the MLWE and MSIS hard problems, with proofs of keyword ciphertext indistinguishability and trapdoor indistinguishability under the random oracle model. Additionally, the scheme provides strong resistance against both outside and insider keyword guessing attacks through sender\u2013receiver binding mechanisms and trapdoor indistinguishability properties. Experimental results show that, compared to the post-quantum schemes CP-Absel and LB-FSSE, the proposed scheme demonstrates superior overall computational efficiency while maintaining stronger quantum resistance than the traditional scheme SM9-PAEKS.<\/jats:p>","DOI":"10.3390\/cryptography10020022","type":"journal-article","created":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:45:42Z","timestamp":1774626342000},"page":"22","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Searchable Encryption Scheme Based on CRYSTALS-Dilithium"],"prefix":"10.3390","volume":"10","author":[{"given":"Minghui","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"},{"name":"School of Cyberspace Security, Sichuan University, Chengdu 610065, China"}]},{"given":"Anqi","family":"Xiao","sequence":"additional","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9674-0380","authenticated-orcid":false,"given":"Shicheng","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"}]},{"given":"Deju","family":"Kong","sequence":"additional","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"},{"name":"School of Cyberspace Security, Sichuan University, Chengdu 610065, China"}]}],"member":"1968","published-online":{"date-parts":[[2026,3,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"250505","DOI":"10.1103\/PhysRevLett.99.250505","article-title":"Experimental demonstration of a compiled version of Shor\u2019s algorithm with quantum entanglement","volume":"99","author":"Lanyon","year":"2007","journal-title":"Phys. Rev. Lett."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"022307","DOI":"10.1103\/PhysRevA.64.022307","article-title":"Grover algorithm with zero theoretical failure rate","volume":"64","author":"Long","year":"2001","journal-title":"Phys. Rev. A"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"21091","DOI":"10.1109\/ACCESS.2020.2968985","article-title":"Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks","volume":"8","year":"2020","journal-title":"IEEE Access"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Song, D.X., Wagner, D., and Perrig, A. (2000). Practical techniques for searches on encrypted data. Proceedings of the 2000 IEEE Symposium on Security and Privacy (S&P 2000), Berkeley, CA, USA, 14\u201317 May 2000, IEEE.","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., and Persiano, G. (2004). Public key encryption with keyword search. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2004), Interlaken, Switzerland, 2\u20136 May 2004, Springer.","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"ref_6","first-page":"330","article-title":"Secure and Efficient Data Retrieval Scheme Using Searchable Encryption in Cloud","volume":"3","author":"Xu","year":"2016","journal-title":"J. Cryptolog. Res."},{"key":"ref_7","first-page":"283","article-title":"Efficient Public Key Encryption with Keyword Search Without Using Secure Channel","volume":"6","author":"Li","year":"2019","journal-title":"J. Cryptolog. Res."},{"key":"ref_8","first-page":"123","article-title":"Analysis and Improvement of Searchable Encryption Scheme Based on Composite-Order Bilinear Pair","volume":"46","author":"Deng","year":"2020","journal-title":"Comput. Eng."},{"key":"ref_9","first-page":"353","article-title":"Multiple Keywords Searchable Encryption Scheme Based on Elliptic Curve","volume":"33","author":"Cui","year":"2019","journal-title":"J. Jinan Univ."},{"key":"ref_10","first-page":"159","article-title":"Searchable Encryption Scheme Based on China State Cryptography Standard SM9","volume":"48","author":"Zhang","year":"2022","journal-title":"Comput. Eng."},{"key":"ref_11","first-page":"4271","article-title":"Public-key Authenticated Encryption Scheme with Keyword Search from Chinese Cryptographic SM9","volume":"36","author":"Pu","year":"2025","journal-title":"J. Softw."},{"key":"ref_12","first-page":"148","article-title":"Adaptive hierarchical searchable encryption scheme based on learning with errors","volume":"40","author":"Zhang","year":"2020","journal-title":"Comput. Appl."},{"key":"ref_13","first-page":"1911","article-title":"TTRC-ABE: A Traceable and Revocable Grid-Based Attribute Encryption Scheme Based on the CLWE Problem","volume":"47","author":"Liu","year":"2025","journal-title":"J. Electron. Inf. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1631\/FITEE.2300248","article-title":"Identity-based searchable attribute signcryption in lattice for a blockchain-based medical system","volume":"25","author":"Yu","year":"2024","journal-title":"Front. Inf. Technol. Electron. Eng."},{"key":"ref_15","first-page":"1290","article-title":"CP-ABSEL: Ciphertext-policy attribute-based searchable encryption from lattice in cloud storage","volume":"10","author":"Varri","year":"2021","journal-title":"J. Cloud Comp."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"107533","DOI":"10.1016\/j.compeleceng.2021.107533","article-title":"An efficient and forward-secure lattice-based searchable encryption scheme for the Big-data era","volume":"96","author":"Islam","year":"2021","journal-title":"Comput. Electr. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","article-title":"CRYSTALS-Dilithium: A lattice-based digital signature scheme","volume":"2018","author":"Ducas","year":"2018","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"ref_18","unstructured":"National Institute of Standards and Technology (NIST) (2024). FIPS 204: Module-Lattice-Based Digital Signature Standard, U.S. Department of Commerce."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Schwabe, P., Seiler, G., and Stehl\u00e9, D. (2018). CRYSTALS\u2013Kyber: A CCA-Secure Module-Lattice-Based KEM. Proceedings of the IEEE European Symposium on Security and Privacy (EuroS&P 2018), London, UK, 24\u201326 April 2018, IEEE.","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., and Seiler, G. (2018). Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs. Proceedings of the Advances in Cryptology\u2013EUROCRYPT 2018, Tel Aviv, Israel, 29 April\u20133 May 2018, Springer.","DOI":"10.1007\/978-3-319-78381-9_8"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/10\/2\/22\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T04:19:35Z","timestamp":1774930775000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/10\/2\/22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,27]]},"references-count":20,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["cryptography10020022"],"URL":"https:\/\/doi.org\/10.3390\/cryptography10020022","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,27]]}}}