{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T04:32:45Z","timestamp":1774240365761,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Major Basic Research Project of Natural Science Foundation of Shandong Province, China","award":["ZR202010220025"],"award-info":[{"award-number":["ZR202010220025"]}]},{"name":"National Key Research and Development Program of China","award":["2021YFB3100200"],"award-info":[{"award-number":["2021YFB3100200"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11227-023-05574-9","type":"journal-article","created":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T10:01:55Z","timestamp":1692612115000},"page":"2767-2798","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["RLWE-based public key searchable encryption: securer, faster, and lower end-to-end delay for cloud computing"],"prefix":"10.1007","volume":"80","author":[{"given":"Lijun","family":"Qi","sequence":"first","affiliation":[]},{"given":"Jincheng","family":"Zhuang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,21]]},"reference":[{"key":"5574_CR1","doi-asserted-by":"publisher","unstructured":"Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE Symposium on Security and Privacy. S P 2000, pp 44\u201355. https:\/\/doi.org\/10.1109\/SECPRI.2000.848445","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"5574_CR2","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume":"2004","author":"D Boneh","year":"2004","unstructured":"Boneh D, Di Crescenzo G, Ostrovsky R et al (2004) Public key encryption with keyword search. Adv Cryptol\u2014EUROCRYPT 2004:506\u2013522. https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30","journal-title":"Adv Cryptol\u2014EUROCRYPT"},{"issue":"2","key":"5574_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TCC.2014.2358220","volume":"3","author":"CQ Wu","year":"2014","unstructured":"Wu CQ, Lin X, Yu D et al (2014) End-to-end delay minimization for scientific workflows in clouds under budget constraint. IEEE Trans Cloud Comput 3(2):169\u2013181","journal-title":"IEEE Trans Cloud Comput"},{"key":"5574_CR4","doi-asserted-by":"crossref","unstructured":"Jang W, Jeong H, Kang K, et\u00a0al (2020) R-tod: Real-time object detector with minimized end-to-end delay for autonomous driving. In: 2020 IEEE Real-Time Systems Symposium (RTSS). IEEE, pp 191\u2013204","DOI":"10.1109\/RTSS49844.2020.00027"},{"key":"5574_CR5","doi-asserted-by":"crossref","unstructured":"Li H, Cheng Y, Zhou C, et\u00a0al (2009) Minimizing end-to-end delay: A novel routing metric for multi-radio wireless mesh networks. In: IEEE INFOCOM 2009. IEEE, pp 46\u201354","DOI":"10.1109\/INFCOM.2009.5061905"},{"key":"5574_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.sysarc.2021.102271","volume":"403","author":"Q Huang","year":"2017","unstructured":"Huang Q, Li H (2017) An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf Sci 403:1\u201314. https:\/\/doi.org\/10.1016\/j.sysarc.2021.102271","journal-title":"Inf Sci"},{"key":"5574_CR7","doi-asserted-by":"publisher","unstructured":"Byun JW, Rhee HS, Park HA, et\u00a0al (2006) Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Secure Data Management, pp 75\u201383. https:\/\/doi.org\/10.1007\/11844662_6","DOI":"10.1007\/11844662_6"},{"key":"5574_CR8","doi-asserted-by":"publisher","unstructured":"Yau WC, Heng SH, Goi BM (2008) Off-line keyword guessing attacks on recent public key encryption with keyword search schemes. In: Autonomic and Trusted Computing, pp 100\u2013105. https:\/\/doi.org\/10.1007\/11844662_6","DOI":"10.1007\/11844662_6"},{"key":"5574_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.ins.2019.12.063","volume":"516","author":"B Qin","year":"2020","unstructured":"Qin B, Chen Y, Huang Q et al (2020) Public-key authenticated encryption with keyword search revisited: Security model and constructions. Inf Sci 516:515\u2013528. https:\/\/doi.org\/10.1016\/j.ins.2019.12.063","journal-title":"Inf Sci"},{"issue":"102","key":"5574_CR10","doi-asserted-by":"publisher","first-page":"075","DOI":"10.1016\/j.sysarc.2021.102075","volume":"115","author":"X Pan","year":"2021","unstructured":"Pan X, Li F (2021) Public-key authenticated encryption with keyword search achieving both multi-ciphertext and multi-trapdoor indistinguishability. J Syst Architect 115(102):075. https:\/\/doi.org\/10.1016\/j.sysarc.2021.102075","journal-title":"J Syst Architect"},{"issue":"1","key":"5574_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13677-022-00287-5","volume":"11","author":"J Guo","year":"2022","unstructured":"Guo J, Han L, Yang G et al (2022) An improved secure designated server public key searchable encryption scheme with multi-ciphertext indistinguishability. J Cloud Comput 11(1):1\u201312","journal-title":"J Cloud Comput"},{"issue":"1","key":"5574_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13677-022-00283-9","volume":"11","author":"N Yang","year":"2022","unstructured":"Yang N, Zhou Q, Huang Q et al (2022) Multi-recipient encryption with keyword search without pairing for cloud storage. J Cloud Comput 11(1):1\u201312","journal-title":"J Cloud Comput"},{"key":"5574_CR13","doi-asserted-by":"publisher","unstructured":"Anada H, Kanaoka A, Matsuzaki N, et\u00a0al (2018) Key-updatable public-key encryption with keyword search: Models and generic constructions. In: Information Security and Privacy, pp 341\u2013359. https:\/\/doi.org\/10.1007\/978-3-319-93638-3_20","DOI":"10.1007\/978-3-319-93638-3_20"},{"key":"5574_CR14","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-77026-8\\_21","volume":"2007","author":"G Di Crescenzo","year":"2007","unstructured":"Di Crescenzo G, Saraswat V (2007) Public key encryption with searchable keywords based on Jacobi symbols. Prog Cryptol\u2014INDOCRYPT 2007:282\u2013296. https:\/\/doi.org\/10.1007\/978-3-540-77026-8_21","journal-title":"Prog Cryptol\u2014INDOCRYPT"},{"key":"5574_CR15","doi-asserted-by":"publisher","unstructured":"Gu C, Zheng Y, Kang F, et\u00a0al (2015) Keyword search over encrypted data in cloud computing from lattices in the standard model. In: Cloud Computing and Big Data, pp 335\u2013343. https:\/\/doi.org\/10.1007\/978-3-319-28430-9_25","DOI":"10.1007\/978-3-319-28430-9_25"},{"key":"5574_CR16","doi-asserted-by":"publisher","unstructured":"Kuchta V, Markowitch O (2017) Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices. In: Paradigms in Cryptology\u2014Mycrypt 2016. Malicious and Exploratory Cryptology, pp 409\u2013435. https:\/\/doi.org\/10.1007\/978-3-319-61273-7_20","DOI":"10.1007\/978-3-319-61273-7_20"},{"issue":"11","key":"5574_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3531","volume":"30","author":"Y Mao","year":"2019","unstructured":"Mao Y, Fu X, Guo C et al (2019) Public key encryption with conjunctive keyword search secure against keyword guessing attack from lattices. Trans Emerging Telecommun Technol 30(11):e3531. https:\/\/doi.org\/10.1002\/ett.3531","journal-title":"Trans Emerging Telecommun Technol"},{"key":"5574_CR18","doi-asserted-by":"publisher","unstructured":"Xu L, Yuan X, Steinfeld R, et\u00a0al (2019) Multi-writer searchable encryption: an LWE-based realization and implementation. In: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, pp 122\u2013133. https:\/\/doi.org\/10.1145\/3321705.3329814","DOI":"10.1145\/3321705.3329814"},{"issue":"19","key":"5574_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4211","volume":"29","author":"Y Yang","year":"2017","unstructured":"Yang Y, Zheng X, Chang V et al (2017) Semantic keyword searchable proxy re-encryption for postquantum secure cloud storage. Concurr Comput: Pract Exp 29(19):e4211. https:\/\/doi.org\/10.1002\/cpe.4211","journal-title":"Concurr Comput: Pract Exp"},{"issue":"4","key":"5574_CR20","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/CC.2018.8357694","volume":"15","author":"X Zhang","year":"2018","unstructured":"Zhang X, Xu C, Mu L et al (2018) Identity-based encryption with keyword search from lattice assumption. China Commun 15(4):164\u2013178. https:\/\/doi.org\/10.1109\/CC.2018.8357694","journal-title":"China Commun"},{"issue":"3","key":"5574_CR21","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1109\/TDSC.2019.2914117","volume":"18","author":"X Zhang","year":"2021","unstructured":"Zhang X, Xu C, Wang H et al (2021) 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\u20131032. https:\/\/doi.org\/10.1109\/TDSC.2019.2914117","journal-title":"IEEE Trans Depend Secur Comput"},{"issue":"6","key":"5574_CR22","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1109\/TDSC.2018.2867462","volume":"17","author":"R Behnia","year":"2020","unstructured":"Behnia R, Ozmen MO, Yavuz AA (2020) Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans Depend Secur Comput 17(6):1269\u20131282. https:\/\/doi.org\/10.1109\/TDSC.2018.2867462","journal-title":"IEEE Trans Depend Secur Comput"},{"key":"5574_CR23","doi-asserted-by":"crossref","unstructured":"Liu ZY, Tseng YF, Tso R, et\u00a0al (2021) Public-key authenticated encryption with keyword search: Cryptanalysis, enhanced security, and quantum-resistant instantiation. Cryptology ePrint Archive","DOI":"10.1093\/comjnl\/bxab119"},{"key":"5574_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-031-17140-6_15","volume-title":"Computer security\u2014ESORICS 2022","author":"L Cheng","year":"2022","unstructured":"Cheng L, Meng F (2022) Public key authenticated encryption with keyword search from LWE. In: Atluri V, Di Pietro R, Jensen CD et al (eds) Computer security\u2014ESORICS 2022. Springer, Cham, pp 303\u2013324"},{"key":"5574_CR25","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4\\_41","volume":"2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio D, Peikert C (2012) Trapdoors for lattices: simpler, tighter, faster, smaller. Adv Cryptol\u2014EUROCRYPT 2012:700\u2013718. https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","journal-title":"Adv Cryptol\u2014EUROCRYPT"},{"key":"5574_CR26","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-78381-9\\_7","volume":"2018","author":"N Genise","year":"2018","unstructured":"Genise N, Micciancio D (2018) Faster gaussian sampling for trapdoor lattices with arbitrary modulus. Adv Cryptol\u2014EUROCRYPT 2018:174\u2013203. https:\/\/doi.org\/10.1007\/978-3-319-78381-9_7","journal-title":"Adv Cryptol\u2014EUROCRYPT"},{"issue":"3","key":"5574_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.3233\/JCS-2010-0415","volume":"19","author":"C Dong","year":"2011","unstructured":"Dong C, Russello G, Dulay N (2011) Shared and searchable encrypted data for untrusted servers. J Comput Secur 19(3):367\u2013397","journal-title":"J Comput Secur"},{"key":"5574_CR28","doi-asserted-by":"publisher","unstructured":"Xu L, Yuan X, Steinfeld R, et\u00a0al (2019) Multi-writer searchable encryption: an LWE-based realization and implementation. In: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, Asia CCS \u201919, pp 122\u2013133. https:\/\/doi.org\/10.1145\/3321705.3329814","DOI":"10.1145\/3321705.3329814"},{"key":"5574_CR29","doi-asserted-by":"publisher","unstructured":"Yu X, Xu C, Xu L, et\u00a0al (2020) Lattice-based searchable encryption scheme against inside keywords guessing attack. Comput, Mater Contin 64(2):1107\u20131125. https:\/\/doi.org\/10.32604\/cmc.2020.09680","DOI":"10.32604\/cmc.2020.09680"},{"key":"5574_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. Adv. Cryptol\u2014EUROCRYPT 2010:1\u201323. https:\/\/doi.org\/10.1145\/2535925","journal-title":"Adv. Cryptol\u2014EUROCRYPT"},{"key":"5574_CR31","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7\\_36","volume":"2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9 D, Steinfeld R, Tanaka K et al (2009) Efficient public key encryption based on ideal lattices. Adv Cryptol\u2014ASIACRYPT 2009:617\u2013635. https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36","journal-title":"Adv Cryptol\u2014ASIACRYPT"},{"key":"5574_CR32","doi-asserted-by":"publisher","unstructured":"Lyubashevsky V, Micciancio D (2006) Generalized compact knapsacks are collision resistant. In: Automata, Languages and Programming, pp 144\u2013155. https:\/\/doi.org\/10.1007\/11787006_13","DOI":"10.1007\/11787006_13"},{"key":"5574_CR33","doi-asserted-by":"publisher","unstructured":"Peikert C, Rosen A (2006) Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Theory of Cryptography, pp 145\u2013166. https:\/\/doi.org\/10.1007\/11681878_8","DOI":"10.1007\/11681878_8"},{"key":"5574_CR34","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5\\_28","volume":"2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal S, Boneh D, Boyen X (2010) Efficient lattice (H)IBE in the standard model. Adv Cryptol\u2014EUROCRYPT 2010:553\u2013572. https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28","journal-title":"Adv Cryptol\u2014EUROCRYPT"},{"key":"5574_CR35","doi-asserted-by":"publisher","unstructured":"Bert P, Fouque PA, Roux-Langlois A, et\u00a0al (2018) Practical implementation of Ring-SIS\/LWE based signature and IBE. In: Post-Quantum Cryptography, pp 271\u2013291. https:\/\/doi.org\/10.1007\/978-3-319-79063-3_13","DOI":"10.1007\/978-3-319-79063-3_13"},{"key":"5574_CR36","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11535218\\_13","volume":"2005","author":"M Abdalla","year":"2005","unstructured":"Abdalla M, Bellare M, Catalano D et al (2005) Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. Adv Cryptol\u2014CRYPTO 2005:205\u2013222. https:\/\/doi.org\/10.1007\/11535218_13","journal-title":"Adv Cryptol\u2014CRYPTO"},{"key":"5574_CR37","doi-asserted-by":"publisher","unstructured":"Bellare M, Boldyreva A, Desai A, et\u00a0al (2001) Key-privacy in public-key encryption. In: Advances in Cryptology\u2014ASIACRYPT 2001, pp 566\u2013582. https:\/\/doi.org\/10.1007\/3-540-45682-1_33","DOI":"10.1007\/3-540-45682-1_33"},{"key":"5574_CR38","doi-asserted-by":"publisher","unstructured":"Dai H, Yang M, Yang G, et\u00a0al (2021) A keyword-grouping inverted index based multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Sustain Comput. https:\/\/doi.org\/10.1109\/TSUSC.2021.3125520","DOI":"10.1109\/TSUSC.2021.3125520"},{"issue":"102","key":"5574_CR39","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1016\/j.jisa.2021.102902","volume":"61","author":"M Hozhabr","year":"2021","unstructured":"Hozhabr M, Asghari P, Javadi HHS (2021) Dynamic secure multi-keyword ranked search over encrypted cloud data. Journal of Information Security and Applications 61(102):902. https:\/\/doi.org\/10.1016\/j.jisa.2021.102902","journal-title":"Journal of Information Security and Applications"},{"issue":"102","key":"5574_CR40","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.jnca.2019.102469","volume":"149","author":"H Zhong","year":"2020","unstructured":"Zhong H, Li Z, Cui J et al (2020) Efficient dynamic multi-keyword fuzzy search over encrypted cloud data. J Netw Comput Appl 149(102):469. https:\/\/doi.org\/10.1016\/j.jnca.2019.102469","journal-title":"J Netw Comput Appl"},{"key":"5574_CR41","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2013) A toolkit for ring-LWE cryptography. In: Advances in Cryptology\u2014EUROCRYPT 2013. Springer, Berlin, Heidelberg, pp 35\u201354","DOI":"10.1007\/978-3-642-38348-9_3"},{"issue":"4","key":"5574_CR42","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TDSC.2006.58","volume":"3","author":"Y Zhang","year":"2006","unstructured":"Zhang Y, Liu W, Lou W et al (2006) Securing mobile ad hoc networks with certificateless public keys. IEEE Trans Depend Secur Comput 3(4):386\u2013399. https:\/\/doi.org\/10.1109\/TDSC.2006.58","journal-title":"IEEE Trans Depend Secur Comput"},{"issue":"4","key":"5574_CR43","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/TNSM.2010.1012.0362","volume":"7","author":"FR Yu","year":"2010","unstructured":"Yu FR, Tang H, Mason PC et al (2010) A hierarchical identity based key management scheme in tactical mobile ad hoc networks. IEEE Trans Netw Serv Manage 7(4):258\u2013267. https:\/\/doi.org\/10.1109\/TNSM.2010.1012.0362","journal-title":"IEEE Trans Netw Serv Manage"},{"issue":"11","key":"5574_CR44","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"issue":"3","key":"5574_CR45","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1109\/TDSC.2019.2914117","volume":"18","author":"X Zhang","year":"2021","unstructured":"Zhang X, Xu C, Wang H et al (2021) 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\u20131032. https:\/\/doi.org\/10.1109\/TDSC.2019.2914117","journal-title":"IEEE Trans Depend Secur Comput"},{"key":"5574_CR46","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X (2010) Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Advances in Cryptology\u2013CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15\u201319, 2010. Proceedings 30, Springer, pp 98\u2013115","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"5574_CR47","doi-asserted-by":"publisher","unstructured":"Bost R, Minaud B, Ohrimenko O (2017) Forward and backward private searchable encryption from constrained cryptographic primitives. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, CCS \u201917, pp 1465\u20131482. https:\/\/doi.org\/10.1145\/3133956.3133980","DOI":"10.1145\/3133956.3133980"},{"key":"5574_CR48","doi-asserted-by":"crossref","unstructured":"Green MD, Miers I (2015) Forward secure asynchronous messaging from puncturable encryption. In: 2015 IEEE Symposium on Security and Privacy. IEEE, pp 305\u2013320","DOI":"10.1109\/SP.2015.26"},{"key":"5574_CR49","doi-asserted-by":"crossref","unstructured":"Kellaris G, Kollios G, Nissim K, et\u00a0al (2016) Generic attacks on secure outsourced databases. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp 1329\u20131340","DOI":"10.1145\/2976749.2978386"},{"key":"5574_CR50","doi-asserted-by":"crossref","unstructured":"Grubbs P, Lacharit\u00e9 MS, Minaud B, et\u00a0al (2018) Pump up the volume: practical database reconstruction from volume leakage on range queries. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp 315\u2013331","DOI":"10.1145\/3243734.3243864"},{"key":"5574_CR51","doi-asserted-by":"publisher","unstructured":"Gui Z, Johnson O, Warinschi B (2019) Encrypted databases: New volume attacks against range queries. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, CCS \u201919, pp 361\u2013378. https:\/\/doi.org\/10.1145\/3319535.3363210","DOI":"10.1145\/3319535.3363210"},{"key":"5574_CR52","doi-asserted-by":"crossref","unstructured":"Poddar R, Wang S, Lu J, et\u00a0al (2020) Practical volume-based attacks on encrypted databases. In: 2020 IEEE European Symposium on Security and Privacy (EuroS &P). IEEE, pp 354\u2013369","DOI":"10.1109\/EuroSP48549.2020.00030"},{"key":"5574_CR53","first-page":"327","volume-title":"25th USENIX Security Symposium (USENIX Security 16)","author":"E Alkim","year":"2016","unstructured":"Alkim E, Ducas L, P\u00f6ppelmann T et al (2016) Post-quantum key Exchange\u2014a new hope. 25th USENIX Security Symposium (USENIX Security 16). USENIX Association, Austin, pp 327\u2013343"},{"key":"5574_CR54","doi-asserted-by":"publisher","unstructured":"Bos J, Costello C, Ducas L, et\u00a0al (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. Association for Computing Machinery, New York, NY, USA, CCS \u201916, pp 1006\u20131018. https:\/\/doi.org\/10.1145\/2976749.2978425","DOI":"10.1145\/2976749.2978425"},{"key":"5574_CR55","doi-asserted-by":"publisher","unstructured":"Albrecht MR, Player R, Scott S (2015) On the concrete hardness of learning with errors. In: Journal of Mathematical Cryptology, pp 169\u2013203. https:\/\/doi.org\/10.1515\/jmc-2015-0016","DOI":"10.1515\/jmc-2015-0016"},{"key":"5574_CR56","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05574-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05574-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05574-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T09:37:04Z","timestamp":1705311424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05574-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,21]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5574"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05574-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,21]]},"assertion":[{"value":"3 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2023","order":2,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}