{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T02:07:16Z","timestamp":1763345236729,"version":"3.45.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T00:00:00Z","timestamp":1763337600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T00:00:00Z","timestamp":1763337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["23511100200"],"award-info":[{"award-number":["23511100200"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Pilot Program for Basic Research","award":["TQ20240212"],"award-info":[{"award-number":["TQ20240212"]}]},{"name":"Shanghai Municipal Edu- cation Commission","award":["2021-01-07-00-08-E00101"],"award-info":[{"award-number":["2021-01-07-00-08-E00101"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>With the rise of cloud storage and the looming threat of quantum computing, traditional encryption methods are encountering significant challenges that hinder data manipulation without decryption. To counter quantum attacks while maintaining data manipulation capabilities, new architectures such as quantum-resistant public key encryption with equality test (PKEET) must be developed. Our study presents the initial PKEET that leverages the Learning with Rounding (LWR) problem, which provides security within standard model. We also introduce its variants, public key encryption with delegated equality test (PKE-DET) and PKEET supporting flexible authorization (PKEET-FA). Our proposals could achieve fine-grained delegation at the ciphertext-specified level compared to previous PKE-DET schemes. For example, our PKE-DET supports a delegated tester function while ensuring security against quantum computing threats. Our PKEET-FA could accord users even more controls over what ciphertexts they want to compare. Our schemes\u2019 security is founded on the LWR problem which avoids the need for discrete Gaussian sampling, unlike the Learning with Errors (LWE) problem. This distinction renders our methods both simpler and more efficient compared to those based on LWE. Moreover, our schemes enjoy smaller-sized ciphertexts.<\/jats:p>","DOI":"10.1186\/s42400-025-00356-7","type":"journal-article","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T02:02:36Z","timestamp":1763344956000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Communication-efficient public key encryption with (fine-grained delegated) equality test"],"prefix":"10.1186","volume":"8","author":[{"given":"Wanqing","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1779-6178","authenticated-orcid":false,"given":"Xiangxue","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaogang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,17]]},"reference":[{"key":"356_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X (2010) Efficient lattice (h)ibe in the standard model. In: Advances in cryptology\u2013EUROCRYPT 2010: 29th annual international conference on the theory and applications of cryptographic techniques, pp. 553\u2013572. Springer, French Riviera","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"356_CR2","unstructured":"Alkim E, Ducas L, P\u00f6ppelmann T, Schwabe P (2016) Post-quantum key $$\\{$$Exchange-A$$\\}$$ new hope. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 327\u2013343. USENIX Association, Austin, TX"},{"key":"356_CR3","doi-asserted-by":"crossref","unstructured":"Alwen J, Krenn S, Pietrzak K, Wichs D (2013) Learning with rounding, revisited: New reduction, properties and applications. In: Annual cryptology conference, pp. 57\u201374. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-40041-4_4"},{"issue":"4","key":"356_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"Armbrust M, Fox A, Griffith R, Joseph AD, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I et al (2010) A view of cloud computing. Commun ACM 53(4):50\u201358","journal-title":"Commun ACM"},{"key":"356_CR5","doi-asserted-by":"crossref","unstructured":"Banerjee A, Peikert C, Rosen A (2012) Pseudorandom functions and lattices. In: Annual international conference on the theory and applications of cryptographic techniques, pp. 719\u2013737. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"356_CR6","doi-asserted-by":"crossref","unstructured":"Bert P, Fouque P-A, Roux-Langlois A, Sabt M (2018) Practical implementation of ring-sis\/lwe based signature and ibe. In: Post-quantum cryptography: 9th international conference, PQCrypto 2018, pp. 271\u2013291. Springer, Fort Lauderdale, FL, USA","DOI":"10.1007\/978-3-319-79063-3_13"},{"key":"356_CR7","doi-asserted-by":"crossref","unstructured":"Bogdanov A, Guo S, Masny D, Richelson S, Rosen A (2015) On the hardness of learning with rounding over small modulus. In: Theory of cryptography conference, pp. 209\u2013224. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-662-49096-9_9"},{"key":"356_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: Advances in Cryptology-EUROCRYPT 2004: International conference on the theory and applications of cryptographic techniques, pp. 506\u2013522. Springer, Interlaken, Switzerland","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"356_CR9","doi-asserted-by":"crossref","unstructured":"Bos J, Costello C, Ducas L, Mironov I, Naehrig M, Nikolaenko V, Raghunathan A, Stebila D (2016) Frodo: Take off the ring! practical, quantum-secure key exchange from lwe. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pp. 1006\u20131018. ACM, Vienna, Austria","DOI":"10.1145\/2976749.2978425"},{"key":"356_CR10","doi-asserted-by":"crossref","unstructured":"Bos JW, Costello C, Naehrig M, Stebila D (2015) Post-quantum key exchange for the tls protocol from the ring learning with errors problem. In: 2015 IEEE symposium on security and privacy, pp. 553\u2013570. IEEE, San Jose, CA, USA","DOI":"10.1109\/SP.2015.40"},{"key":"356_CR11","doi-asserted-by":"crossref","unstructured":"Bos J, Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schanck JM, Schwabe P, Seiler G, Stehl\u00e9 D (2018) Crystals-kyber: a cca-secure module-lattice-based kem. In: 2018 IEEE European symposium on security and privacy (EuroS &P), pp. 353\u2013367. IEEE, London, United Kingdom","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"356_CR12","doi-asserted-by":"crossref","unstructured":"Cheon JH, Han K, Kim J, Lee C, Son Y (2016) A practical post-quantum public-key cryptosystem based on. In: International conference on information security and cryptology, pp. 51\u201374. Springer, Seoul, South Korea","DOI":"10.1007\/978-3-319-53177-9_3"},{"key":"356_CR13","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim D, Lee J, Song Y (2018) Lizard: Cut off the tail! a practical post-quantum public-key encryption from lwe and lwr. In: International conference on security and cryptography for networks, pp. 160\u2013177. Springer, Amalfi, Italy","DOI":"10.1007\/978-3-319-98113-0_9"},{"key":"356_CR14","doi-asserted-by":"crossref","unstructured":"Cheon JH, Cho H, Jung J, Lee J, Lee K (2020) Efficient identity-based encryption from lwr. In: Information security and cryptology\u2013ICISC 2019: 22nd international conference, pp. 225\u2013241. Springer, Seoul, South Korea","DOI":"10.1007\/978-3-030-40921-0_14"},{"key":"356_CR15","doi-asserted-by":"crossref","unstructured":"Dodis Y, REYzIN L, Extractors ASF (2004) How to generate strong keys from biometrics and other noisy, data april 13. In: Eurocrypt, pp. 1\u201318. Springer, Interlaken, Switzerland","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"356_CR16","doi-asserted-by":"crossref","unstructured":"Duong DH, Fukushima K, Kiyomoto S, Roy PS, Susilo W (2019) A lattice-based public key encryption with equality test in standard model. In: Information security and privacy: 24th Australasian conference, ACISP 2019, pp. 138\u2013155. Springer, Christchurch, New Zealand","DOI":"10.1007\/978-3-030-21548-4_8"},{"key":"356_CR17","doi-asserted-by":"crossref","unstructured":"Duong DH, Susilo W, Bui MK, Khuc TX (2019) A lattice-based certificateless public key encryption with equality test in standard model. In: International conference on information security and cryptology, pp. 50\u201365. Springer, Nanjing, China","DOI":"10.1007\/978-3-030-42921-8_3"},{"key":"356_CR18","doi-asserted-by":"crossref","unstructured":"Genise N, Micciancio D (2018) Faster gaussian sampling for trapdoor lattices with arbitrary modulus. In: Advances in cryptology\u2013EUROCRYPT 2018: 37th annual international conference on the theory and applications of cryptographic techniques, pp. 174\u2013203. Springer, Tel Aviv, Israel","DOI":"10.1007\/978-3-319-78381-9_7"},{"key":"356_CR19","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth annual ACM symposium on theory of computing, pp. 197\u2013206. ACM, Victoria, BC, Canada","DOI":"10.1145\/1374376.1374407"},{"key":"356_CR20","doi-asserted-by":"crossref","unstructured":"G\u00fcr KD, Polyakov Y, Rohloff K, Ryan GW, Savas E (2018) Implementation and evaluation of improved gaussian sampling for lattice trapdoors. In: Proceedings of the 6th workshop on encrypted computing & applied homomorphic cryptography, pp. 61\u201371. ACM, Toronto, ON, Canada","DOI":"10.1145\/3267973.3267975"},{"issue":"10","key":"356_CR21","doi-asserted-by":"publisher","first-page":"2686","DOI":"10.1093\/comjnl\/bxv025","volume":"58","author":"K Huang","year":"2015","unstructured":"Huang K, Tso R, Chen Y-C, Rahman SMM, Almogren A, Alamri A (2015) Pke-aet: public key encryption with authorized equality test. Comput J 58(10):2686\u20132697","journal-title":"Comput J"},{"key":"356_CR22","doi-asserted-by":"publisher","first-page":"103515","DOI":"10.1016\/j.csi.2021.103515","volume":"76","author":"HQ Le","year":"2021","unstructured":"Le HQ, Duong DH, Roy PS, Susilo W, Fukushima K, Kiyomoto S (2021) Lattice-based signcryption with equality test in standard model. Comput Stand Interfac 76:103515","journal-title":"Comput Stand Interfac"},{"key":"356_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ins.2019.12.023","volume":"516","author":"HT Lee","year":"2020","unstructured":"Lee HT, Ling S, Seo JH, Wang H, Youn T-Y (2020) Public key encryption with equality test in the standard model. Inf Sci 516:89\u2013108","journal-title":"Inf Sci"},{"issue":"1","key":"356_CR24","first-page":"5967635","volume":"2018","author":"F Luo","year":"2018","unstructured":"Luo F, Wang F, Wang K, Li J, Chen K (2018) Lwr-based fully homomorphic encryption, revisited. Secur Commun Netw 2018(1):5967635","journal-title":"Secur Commun Netw"},{"key":"356_CR25","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Advances in Cryptology\u2013EUROCRYPT 2010: 29th annual international conference on the theory and applications of cryptographic techniques, pp. 1\u201323. Springer, French Riviera","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"356_CR26","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.ins.2015.08.053","volume":"328","author":"S Ma","year":"2016","unstructured":"Ma S (2016) Identity-based encryption with outsourced equality test in cloud computing. Inf Sci 328:389\u2013402","journal-title":"Inf Sci"},{"issue":"3","key":"356_CR27","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1109\/TIFS.2014.2378592","volume":"10","author":"S Ma","year":"2014","unstructured":"Ma S, Huang Q, Zhang M, Yang B (2014) Efficient public key encryption with equality test supporting flexible authorization. IEEE Trans Inf Forensics Secur 10(3):458\u2013470","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"4","key":"356_CR28","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1093\/comjnl\/bxu026","volume":"58","author":"S Ma","year":"2015","unstructured":"Ma S, Zhang M, Huang Q, Yang B (2015) Public key encryption with delegated equality test in a multi-user setting. Comput J 58(4):986\u20131002","journal-title":"Comput J"},{"key":"356_CR29","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C (2012) Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Annual international conference on the theory and applications of cryptographic techniques, pp. 700\u2013718. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"356_CR30","doi-asserted-by":"crossref","unstructured":"Peikert C (2014) Lattice cryptography for the internet. In: International workshop on post-quantum cryptography, pp. 197\u2013219. Springer, Waterloo, ON, Canada","DOI":"10.1007\/978-3-319-11659-4_12"},{"key":"356_CR31","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ins.2018.06.025","volume":"462","author":"H Qu","year":"2018","unstructured":"Qu H, Yan Z, Lin X-J, Zhang Q, Sun L (2018) Certificateless public key encryption with equality test. Inf Sci 462:76\u201392","journal-title":"Inf Sci"},{"issue":"6","key":"356_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM) 56(6):1\u201340","journal-title":"J ACM (JACM)"},{"key":"356_CR33","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.tcs.2022.06.034","volume":"929","author":"PS Roy","year":"2022","unstructured":"Roy PS, Duong DH, Susilo W, Sipasseuth A, Fukushima K, Kiyomoto S (2022) Lattice-based public-key encryption with equality test supporting flexible authorization in standard model. Theoret Comput Sci 929:124\u2013139","journal-title":"Theoret Comput Sci"},{"key":"356_CR34","volume-title":"A computational introduction to number theory and algebra","author":"V Shoup","year":"2009","unstructured":"Shoup V (2009) A computational introduction to number theory and algebra. Cambridge University Press, Cambridge, UK"},{"key":"356_CR35","doi-asserted-by":"crossref","unstructured":"Susilo W, Duong DH, Le HQ (2020) Efficient post-quantum identity-based encryption with equality test. In: 2020 IEEE 26th international conference on parallel and distributed systems (ICPADS), pp. 633\u2013640. IEEE, Auckland, New Zealand","DOI":"10.1109\/ICPADS51040.2020.00088"},{"issue":"12","key":"356_CR36","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1002\/sec.418","volume":"5","author":"Q Tang","year":"2012","unstructured":"Tang Q (2012) Public key encryption supporting plaintext equality test and user-specified authorization. Secur Commun Netw 5(12):1351\u20131362","journal-title":"Secur Commun Netw"},{"issue":"4","key":"356_CR37","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1504\/IJACT.2012.048079","volume":"2","author":"Q Tang","year":"2012","unstructured":"Tang Q (2012) Public key encryption schemes supporting equality test with authorisation of different granularity. Int J Appl Cryptogr 2(4):304\u2013321","journal-title":"Int J Appl Cryptogr"},{"key":"356_CR38","doi-asserted-by":"crossref","unstructured":"Tang Q (2011) Towards public key encryption scheme supporting equality test with fine-grained authorization. In: Australasian conference on information security and privacy, pp. 389\u2013406. Springer, Melbourne, Australia","DOI":"10.1007\/978-3-642-22497-3_25"},{"key":"356_CR39","doi-asserted-by":"publisher","first-page":"135999","DOI":"10.1109\/ACCESS.2019.2940646","volume":"7","author":"Y Wang","year":"2019","unstructured":"Wang Y, Huang Q, Li H, Huang J, Yang G, Susilo W (2019) Public key authenticated encryption with designated equality test and its applications in diagnostic related groups. IEEE Access 7:135999\u2013136011","journal-title":"IEEE Access"},{"key":"356_CR40","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.future.2017.03.007","volume":"73","author":"L Wu","year":"2017","unstructured":"Wu L, Zhang Y, Choo K-KR, He D (2017) Efficient and secure identity-based encryption scheme with equality test in cloud computing. Futur Gener Comput Syst 73:22\u201331","journal-title":"Futur Gener Comput Syst"},{"key":"356_CR41","doi-asserted-by":"crossref","unstructured":"Wu Z, Weng J, Yang A, Yao L, Liang X, Jiang Z, Wen J (2021) Efficient and fully secure lattice-based ibe with equality test. In: Information and communications security: 23rd international conference, ICICS 2021, pp. 301\u2013318. Springer, Chongqing, China","DOI":"10.1007\/978-3-030-88052-1_18"},{"key":"356_CR42","doi-asserted-by":"publisher","first-page":"103758","DOI":"10.1016\/j.csi.2023.103758","volume":"87","author":"K Xiao","year":"2024","unstructured":"Xiao K, Chen X, Huang J, Li H, Huang Q (2024) A lattice-based public key encryption scheme with delegated equality test. Comput Stand Interfac 87:103758","journal-title":"Comput Stand Interfac"},{"key":"356_CR43","doi-asserted-by":"publisher","first-page":"120015","DOI":"10.1016\/j.ins.2023.120015","volume":"658","author":"K Xiao","year":"2024","unstructured":"Xiao K, Chen X, Li H, Huang J, Susilo W, Huang Q (2024) A fully secure lattice-based signcryption with designated equality test in standard model. Inf Sci 658:120015","journal-title":"Inf Sci"},{"key":"356_CR44","doi-asserted-by":"publisher","first-page":"12702","DOI":"10.1109\/ACCESS.2017.2716971","volume":"5","author":"Y Xu","year":"2017","unstructured":"Xu Y, Wang M, Zhong H, Cui J, Liu L, Franqueira VN (2017) Verifiable public key encryption scheme with equality test in 5g networks. IEEE Access 5:12702\u201312713","journal-title":"IEEE Access"},{"key":"356_CR45","doi-asserted-by":"crossref","unstructured":"Yang G, Tan CH, Huang Q, Wong DS (2010) Probabilistic public key encryption with equality test. In: Topics in cryptology-CT-RSA 2010: the cryptographers\u2019 track at the RSA conference 2010, pp. 119\u2013131. Springer, San Francisco, CA, USA","DOI":"10.1007\/978-3-642-11925-5_9"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00356-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00356-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00356-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T02:02:40Z","timestamp":1763344960000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-025-00356-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,17]]},"references-count":45,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00356-7","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,17]]},"assertion":[{"value":"5 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"85"}}