{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T01:46:44Z","timestamp":1780537604268,"version":"3.54.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["No.30918012204"],"award-info":[{"award-number":["No.30918012204"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s00500-022-07469-y","type":"journal-article","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T19:02:41Z","timestamp":1663009361000},"page":"11139-11151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hardening secure search in encrypted database: a KGA-resistance conjunctive searchable encryption scheme from lattice"],"prefix":"10.1007","volume":"26","author":[{"given":"Xiaoling","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9380-5913","authenticated-orcid":false,"given":"Chungen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Mei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,12]]},"reference":[{"key":"7469_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X (2010) Efficient lattice (H)IBE in the standard model. In: EUROCRYPT, pp 553\u2013572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"7469_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M (1999) Generating hard instances of the short basis problem. In: ICALP, pp 1\u20139","DOI":"10.1007\/3-540-48523-6_1"},{"key":"7469_CR3","unstructured":"Alwen J, Peikert C (2009) Generating shorter bases for hard random lattices. In: STACS, pp 75\u201386"},{"key":"7469_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013359","DOI":"10.1007\/978-3-319-93638-3_20"},{"key":"7469_CR5","doi-asserted-by":"crossref","unstructured":"Baek J, Safavi-Naini R, Susilo W (2008) Public key encryption with keyword search revisited. In: ICCSA, pp 1249\u20131259","DOI":"10.1007\/978-3-540-69839-5_96"},{"issue":"6","key":"7469_CR6","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 Dependable Secur Comput 17(6):1269\u20131282","journal-title":"IEEE Trans Dependable Secur Comput"},{"key":"7469_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D, Crescenzo GD, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: EUROCRYPT, pp 506\u2013522","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"7469_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D, Waters B (2007) Conjunctive, subset, and range queries on encrypted data. In: TCC, pp 535\u2013554","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"7469_CR9","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Langlois A, Peikert C, Regev O, Stehl\u00e9 D (2013) Classical hardness of learning with errors. In: STOC, pp 575\u2013584","DOI":"10.1145\/2488608.2488680"},{"key":"7469_CR10","doi-asserted-by":"crossref","unstructured":"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\u201383","DOI":"10.1007\/11844662_6"},{"key":"7469_CR11","doi-asserted-by":"crossref","unstructured":"Cash D, Hofheinz D, Kiltz E, Peikert C (2010) Bonsai trees, or how to delegate a lattice basis. In: EUROCRYPT, pp 523\u2013552","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"7469_CR12","doi-asserted-by":"crossref","unstructured":"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\u201376","DOI":"10.1007\/978-3-319-19962-7_4"},{"key":"7469_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013189","DOI":"10.1007\/978-3-642-30428-6_15"},{"key":"7469_CR14","unstructured":"Computer Security\u00a0Division Information Technology\u00a0Laboratory, N.T.U.: Post-quantum cryptography csrc, https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography (2017)"},{"key":"7469_CR15","doi-asserted-by":"crossref","unstructured":"Crescenzo GD, Saraswat V (2007) Public key encryption with searchable keywords based on jacobi symbols. In: INDOCRYPT, pp 282\u2013296","DOI":"10.1007\/978-3-540-77026-8_21"},{"key":"7469_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ins.2013.03.008","volume":"238","author":"L Fang","year":"2013","unstructured":"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\u2013241","journal-title":"Inf Sci"},{"issue":"5","key":"7469_CR17","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10207-018-00426-7","volume":"18","author":"O Farr\u00e0s","year":"2019","unstructured":"Farr\u00e0s O, Ribes-Gonz\u00e1lez J (2019) Provably secure public-key encryption with conjunctive and subset keyword search. Int J Inf Sec 18(5):533\u2013548","journal-title":"Int J Inf Sec"},{"key":"7469_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"7469_CR19","doi-asserted-by":"crossref","unstructured":"Gordon SD, Katz J, Vaikuntanathan V (2010) A group signature scheme from lattice assumptions. In: ASIACRYPT, pp 395\u2013412","DOI":"10.1007\/978-3-642-17373-8_23"},{"key":"7469_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013343","DOI":"10.1007\/978-3-319-28430-9_25"},{"key":"7469_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.03.038","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","journal-title":"Inf Sci"},{"key":"7469_CR22","doi-asserted-by":"crossref","unstructured":"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\u2013435","DOI":"10.1007\/978-3-319-61273-7_20"},{"issue":"3","key":"7469_CR23","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1109\/TIFS.2014.2378592","volume":"10","author":"S Ma","year":"2015","unstructured":"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\u2013470","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"7469_CR24","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1002\/ett.3531"},{"key":"7469_CR25","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C (2012) Trapdoors for lattices: Simpler, tighter, faster, smaller. In: EUROCRYPT, pp 700\u2013718","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"7469_CR26","doi-asserted-by":"crossref","unstructured":"Park DJ, Kim K, Lee PJ (2004) Public key encryption with conjunctive field keyword search. In: Information Security Applications, WISA, pp 73\u201386","DOI":"10.1007\/978-3-540-31815-6_7"},{"issue":"6","key":"7469_CR27","doi-asserted-by":"publisher","first-page":"34: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 56(6):34:1-34:40","journal-title":"J ACM"},{"key":"7469_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ins.2012.03.020","volume":"205","author":"HS Rhee","year":"2012","unstructured":"Rhee HS, Park JH, Lee DH (2012) Generic construction of designated tester public-key encryption with keyword search. Inf Sci 205:93\u2013109","journal-title":"Inf Sci"},{"key":"7469_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013379","DOI":"10.1145\/1533057.1533108"},{"issue":"5","key":"7469_CR30","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.jss.2009.11.726","volume":"83","author":"HS Rhee","year":"2010","unstructured":"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\u2013771","journal-title":"J Syst Softw"},{"key":"7469_CR31","doi-asserted-by":"crossref","unstructured":"Rompay CV, Molva R, \u00d6nen M (2018) Secure and scalable multi-user searchable encryption. In: Proceedings of the 6th international workshop on security in cloud computing, AsiaCCS, pp 15\u201325","DOI":"10.1145\/3201595.3201597"},{"key":"7469_CR32","doi-asserted-by":"crossref","unstructured":"Ryu E, Takagi T (2007) Efficient conjunctive keyword-searchable encryption. In: 21st international conference on advanced information networking and applications (AINA), pp 409\u2013414","DOI":"10.1109\/AINAW.2007.166"},{"key":"7469_CR33","unstructured":"Song DX, Wagner DA, Perrig A (2000) Practical techniques for searches on encrypted data. In: IEEE symposium on security and privacy, pp 44\u201355"},{"key":"7469_CR34","doi-asserted-by":"crossref","unstructured":"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\u20131198","DOI":"10.1109\/TPDS.2014.2355202"},{"key":"7469_CR35","doi-asserted-by":"crossref","unstructured":"Takagi T (2018) Recent developments in post-quantum cryptography. IEICE Trans 101\u2013A(1):3\u201311","DOI":"10.1587\/transfun.E101.A.3"},{"key":"7469_CR36","doi-asserted-by":"crossref","unstructured":"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\u201342453","DOI":"10.1109\/ACCESS.2018.2861424"},{"key":"7469_CR37","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.jnca.2018.12.003","volume":"128","author":"L Xu","year":"2019","unstructured":"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\u201320","journal-title":"J Netw Comput Appl"},{"key":"7469_CR38","doi-asserted-by":"crossref","unstructured":"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\u2013133","DOI":"10.1145\/3321705.3329814"},{"issue":"11","key":"7469_CR39","doi-asserted-by":"publisher","first-page":"2266","DOI":"10.1109\/TC.2012.215","volume":"62","author":"P Xu","year":"2013","unstructured":"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\u20132277","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"7469_CR40","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1109\/TIFS.2015.2509912","volume":"11","author":"Y Yang","year":"2016","unstructured":"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\u2013759","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"7469_CR41","doi-asserted-by":"crossref","unstructured":"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\u20139941","DOI":"10.1007\/s11042-017-4560-x"},{"issue":"1","key":"7469_CR42","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.jnca.2010.07.007","volume":"34","author":"B Zhang","year":"2011","unstructured":"Zhang B, Zhang F (2011) An efficient public key encryption with conjunctive-subset keywords search. J Netw Comput Appl 34(1):262\u2013267","journal-title":"J Netw Comput Appl"},{"issue":"3","key":"7469_CR43","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11277-018-5357-6","volume":"100","author":"X Zhang","year":"2018","unstructured":"Zhang X, Xu C (2018) Trapdoor security lattice-based public-key searchable encryption with a designated cloud server. Wirel Pers Commun 100(3):907\u2013921","journal-title":"Wirel Pers Commun"},{"issue":"4","key":"7469_CR44","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, Zhao J (2018) Identity-based encryption with keyword search from lattice assumption. China Commun 15(4):164\u2013178","journal-title":"China Commun"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07469-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07469-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07469-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T21:28:47Z","timestamp":1701034127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07469-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,12]]},"references-count":44,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["7469"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07469-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,12]]},"assertion":[{"value":"17 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2022","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 there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}