{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T22:37:05Z","timestamp":1770331025155,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:00:00Z","timestamp":1764979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:00:00Z","timestamp":1768435200000},"content-version":"vor","delay-in-days":40,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Key Project of Science and Technology Research by Chongqing Education Commission","award":["KJZD-K202400610"],"award-info":[{"award-number":["KJZD-K202400610"]}]},{"name":"Chongqing Natural Science Foundation General Project","award":["CSTB2025NSCQ-GPX1263"],"award-info":[{"award-number":["CSTB2025NSCQ-GPX1263"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s44443-025-00405-8","type":"journal-article","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T10:13:47Z","timestamp":1765016027000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["EVMK-SSE: Efficient and Verifiable Multi-Keyword SSE from client-independent relaxed OPRF for outsourced database in cloud"],"prefix":"10.1007","volume":"38","author":[{"given":"Huihui","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0048-9876","authenticated-orcid":false,"given":"Fei","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyong","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Iasenovets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,6]]},"reference":[{"key":"405_CR1","first-page":"115","volume":"1","author":"A Bag","year":"2023","unstructured":"Bag A, Talapatra D, Rastogi A, Patranabis S, Mukhopadhyay D (2023) Two-in-one-sse: fast, scalable and storage-efficient searchable symmetric encryption for conjunctive and disjunctive boolean queries. Proc Priv Enh Technol 1:115\u2013139","journal-title":"Proc Priv Enh Technol"},{"key":"405_CR2","doi-asserted-by":"crossref","unstructured":"Boneh D, Di\u00a0Crescenzo G, Ostrovsky R, Persiano G 2004 Public key encryption with keyword search. Springer, pp 506\u2013522","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"405_CR3","doi-asserted-by":"crossref","unstructured":"Bost R (2016) $$\\sum $$ o$$\\varphi $$o$$\\varsigma $$: Forward secure searchable encryption, 1143\u20131154","DOI":"10.1145\/2976749.2978303"},{"key":"405_CR4","doi-asserted-by":"crossref","unstructured":"Bost R, Minaud B, Ohrimenko O (2017) Forward and backward private searchable encryption from constrained cryptographic primitives, 1465\u20131482","DOI":"10.1145\/3133956.3133980"},{"key":"405_CR5","doi-asserted-by":"crossref","unstructured":"Casacuberta S, Hesse J, Lehmann A (2022) Sok: oblivious pseudorandom functions. IEEE, pp 625\u2013646","DOI":"10.1109\/EuroSP53844.2022.00045"},{"key":"405_CR6","doi-asserted-by":"crossref","unstructured":"Cash D et\u00a0al (2013) Highly-scalable searchable symmetric encryption with support for boolean queries. Springer, pp 353\u2013373","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"405_CR7","doi-asserted-by":"crossref","unstructured":"Chai Q, Gong G (2012) Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. IEEE, pp 917\u2013922","DOI":"10.1109\/ICC.2012.6364125"},{"key":"405_CR8","doi-asserted-by":"crossref","unstructured":"Chase M, Miao P, Micciancio D, Ristenpart T (2020) Private set intersection in the internet setting from lightweight oblivious prf. In: Micciancio D, Ristenpart T (eds) Advances in Cryptology \u2013 CRYPTO 2020. Springer International Publishing, Cham, pp 34\u201363","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"405_CR9","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1109\/TIFS.2023.3275750","volume":"18","author":"B Chen","year":"2023","unstructured":"Chen B, Xiang T, He D, Li H, Choo K-KR (2023) Bpvse: Publicly verifiable searchable encryption for cloud-assisted electronic health records. IEEE Trans Inf Forensics Secur 18:3171\u20133184","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"405_CR10","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau C (1987) Equivalence between two flavours of oblivious transfers. Springer, pp 350\u2013354","DOI":"10.1007\/3-540-48184-2_30"},{"key":"405_CR11","doi-asserted-by":"crossref","unstructured":"Curtmola R, Garay J, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption: improved definitions and efficient constructions, pp 79\u201388","DOI":"10.1145\/1180405.1180417"},{"key":"405_CR12","doi-asserted-by":"crossref","unstructured":"Deng Q, Chen L, Zhu Y, Mu Y (2025) Leakage reduced searchable symmetric encryption for multi-keyword queries. IEEE Trans Cloud Comput 1\u201313","DOI":"10.1109\/TCC.2025.3573378"},{"key":"405_CR13","doi-asserted-by":"crossref","unstructured":"Freedman, MJ, Ishai Y, Pinkas B, Reingold O (2005) Keyword search and oblivious pseudorandom functions. Springer, pp303\u2013324","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"405_CR14","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1109\/TDSC.2019.2896258","volume":"18","author":"X Ge","year":"2019","unstructured":"Ge X et al (2019) Towards achieving keyword search over dynamic encrypted cloud data with symmetric-key based verification. IEEE Trans Dependable Secure Comput 18:490\u2013504","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"405_CR15","doi-asserted-by":"crossref","unstructured":"Ghareh\u00a0Chamani J, Papadopoulos D, Papamanthou C, Jalili R (2018) New constructions for forward and backward private symmetric searchable encryption. pp 1038\u20131055","DOI":"10.1145\/3243734.3243833"},{"key":"405_CR16","unstructured":"Goh E-J (2003) Secure indexes. Cryptology ePrint Archive"},{"key":"405_CR17","doi-asserted-by":"crossref","unstructured":"Gui Z, Paterson KG, Patranabis S (2023) Rethinking searchable symmetric encryption. IEEE, pp 1401\u20131418","DOI":"10.1109\/SP46215.2023.10179460"},{"key":"405_CR18","first-page":"549","volume":"1","author":"Z Gui","year":"2024","unstructured":"Gui Z, Paterson KG, Patranabis S, Warinschi B (2024) Swissse: System-wide security for searchable symmetric encryption. Proc Priv Enh Technol 1:549\u2013581","journal-title":"Proc Priv Enh Technol"},{"key":"405_CR19","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1109\/TIFS.2020.3033412","volume":"16","author":"K He","year":"2020","unstructured":"He K, Chen J, Zhou Q, Du R, Xiang Y (2020) Secure dynamic searchable symmetric encryption with constant client storage cost. IEEE Trans Inf Forensics Secur 16:1538\u20131549","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"405_CR20","doi-asserted-by":"crossref","unstructured":"Ishai Y, Kilian J, Nissim K, Petrank E (2003) Extending oblivious transfers efficiently. Springer, pp 145\u2013161","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"405_CR21","doi-asserted-by":"crossref","unstructured":"Jarecki S, Liu X (2009) Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection. Springer, pp 577\u2013594","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"405_CR22","doi-asserted-by":"crossref","unstructured":"Jarecki S, Krawczyk H, Xu J (2021) On the (in) security of the diffie-hellman oblivious prf with multiplicative blinding. Springer, pp 380\u2013409","DOI":"10.1007\/978-3-030-75248-4_14"},{"key":"405_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ins.2017.03.037","volume":"403","author":"X Jiang","year":"2017","unstructured":"Jiang X, Yu J, Yan J, Hao R (2017) Enabling efficient and verifiable multi-keyword ranked search over encrypted cloud data. Inf Sci 403:22\u201341","journal-title":"Inf Sci"},{"key":"405_CR24","doi-asserted-by":"crossref","unstructured":"Jutla C, Patranabis S (2022) Efficient searchable symmetric encryption for join queries. Springer, pp 304\u2013333","DOI":"10.1007\/978-3-031-22969-5_11"},{"key":"405_CR25","doi-asserted-by":"crossref","unstructured":"Kamara S, Papamanthou C, Roeder T (2012) Dynamic searchable symmetric encryption. pp 965\u2013976","DOI":"10.1145\/2382196.2382298"},{"key":"405_CR26","doi-asserted-by":"crossref","unstructured":"Kolesnikov V, Kumaresan R, Rosulek M, Trieu N (2016) Efficient batched oblivious prf with applications to private set intersection. pp 818\u2013829","DOI":"10.1145\/2976749.2978381"},{"key":"405_CR27","doi-asserted-by":"publisher","first-page":"3527","DOI":"10.1109\/TSC.2024.3489432","volume":"17","author":"X Kong","year":"2024","unstructured":"Kong X, Chen L, Zhu Y, Mu Y (2024) Efficient public-key searchable encryption scheme from psi with scalable proxy servers. IEEE Trans Serv Comput 17:3527\u20133540","journal-title":"IEEE Trans Serv Comput"},{"key":"405_CR28","doi-asserted-by":"crossref","unstructured":"Lai S et\u00a0al (2018) Result pattern hiding searchable encryption for conjunctive queries. pp 745\u2013762","DOI":"10.1145\/3243734.3243753"},{"key":"405_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TC.2024.3485172","volume":"74","author":"J Li","year":"2025","unstructured":"Li J, Ji L, Zhang Y, Lu Y, Ning J (2025) Response-hiding and volume-hiding verifiable searchable encryption with conjunctive keyword search. IEEE Trans Comput 74:455\u2013467","journal-title":"IEEE Trans Comput"},{"key":"405_CR30","doi-asserted-by":"publisher","first-page":"3597","DOI":"10.1109\/TDSC.2023.3335304","volume":"21","author":"F Liu","year":"2023","unstructured":"Liu F et al (2023) Volume-hiding range searchable symmetric encryption for large-scale datasets. IEEE Trans Dependable Secure Comput 21:3597\u20133609","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"405_CR31","doi-asserted-by":"publisher","first-page":"1961","DOI":"10.1109\/TKDE.2023.3329234","volume":"37","author":"S Lv","year":"2025","unstructured":"Lv S et al (2025) Luna: Efficient backward-private dynamic symmetric searchable encryption scheme with secure deletion in encrypted database. IEEE Trans Knowl Data Eng 37:1961\u20131974","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"405_CR32","first-page":"0278","volume":"20","author":"D McGrew","year":"2004","unstructured":"McGrew D, Viega J (2004) The galois\/counter mode of operation (gcm). Submission to NIST Modes of Operation Process 20:0278\u20130070","journal-title":"Submission to NIST Modes of Operation Process"},{"key":"405_CR33","doi-asserted-by":"crossref","unstructured":"Miao Y et al (2018) Lightweight fine-grained search over encrypted data in fog computing. IEEE Trans Serv Comput 12:772\u2013785","DOI":"10.1109\/TSC.2018.2823309"},{"key":"405_CR34","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh R, Rodler FF (2004) Cuckoo hashing. J Algorithms 51:122\u2013144","journal-title":"J Algorithms"},{"key":"405_CR35","doi-asserted-by":"crossref","unstructured":"Rogaway P (2002)Authenticated-encryption with associated-data. pp 98\u2013107","DOI":"10.1145\/586110.586125"},{"key":"405_CR36","unstructured":"Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. IEEE, pp 44\u201355"},{"key":"405_CR37","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1109\/TIFS.2020.3042058","volume":"16","author":"Q Song","year":"2020","unstructured":"Song Q et al (2020) Sap-sse: Protecting search patterns and access patterns in searchable symmetric encryption. IEEE Trans Inf Forensics Secur 16:1795\u20131809","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"405_CR38","doi-asserted-by":"crossref","unstructured":"Stefanov E, Papamanthou C, Shi E (2013) Practical dynamic searchable encryption with small leakage. Cryptology ePrint Archive","DOI":"10.14722\/ndss.2014.23298"},{"key":"405_CR39","doi-asserted-by":"crossref","unstructured":"Sun W, Liu X, Lou W, Hou YT, Li H (2015) Catch you if you lie to me: Efficient verifiable conjunctive keyword search over large dynamic encrypted cloud data. IEEE, pp 2110\u20132118","DOI":"10.1109\/INFOCOM.2015.7218596"},{"key":"405_CR40","first-page":"1","volume":"49","author":"J Tang","year":"2016","unstructured":"Tang J et al (2016) Ensuring security and privacy preservation for cloud data services. ACM Computing Surveys (CSUR) 49:1\u201339","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"405_CR41","doi-asserted-by":"publisher","first-page":"2365","DOI":"10.1109\/TSC.2024.3436573","volume":"17","author":"F Tang","year":"2024","unstructured":"Tang F et al (2024) Efficient privacy-preserving multi-dimensional range query for cloud-assisted ehealth systems. IEEE Trans Serv Comput 17:2365\u20132377","journal-title":"IEEE Trans Serv Comput"},{"key":"405_CR42","first-page":"475","volume":"3","author":"X Wang","year":"2025","unstructured":"Wang X, Lu Z, Liang B, Meng S (2025) Unbalanced private set intersection from client-independent relaxed oblivious prf. Proc Priv Enh Technol 3:475\u2013493","journal-title":"Proc Priv Enh Technol"},{"key":"405_CR43","doi-asserted-by":"crossref","unstructured":"Wu J, Zhang K, Wei L, Gong J, Ning J (2024) Practical searchable symmetric encryption for arbitrary boolean query-join in cloud storage. IEEE Trans Inf Forensics Secur 19:10086\u201310098","DOI":"10.1109\/TIFS.2024.3486002"},{"key":"405_CR44","doi-asserted-by":"crossref","unstructured":"Xie M, Yang X, Hong H, Wei G, Zhang Z (2024) A novel verifiable Chinese multi-keyword fuzzy rank searchable encryption scheme in cloud environments. Futur Gener Comput Syst 153:287\u2013300","DOI":"10.1016\/j.future.2023.11.017"},{"key":"405_CR45","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TSC.2024.3356728","volume":"17","author":"Y Yang","year":"2024","unstructured":"Yang Y et al (2024) Lse: Efficient symmetric searchable encryption based on labeled psi. IEEE Trans Serv Comput 17:563\u2013574","journal-title":"IEEE Trans Serv Comput"},{"key":"405_CR46","doi-asserted-by":"publisher","first-page":"175811","DOI":"10.1007\/s11704-022-2236-9","volume":"17","author":"Y Yang","year":"2023","unstructured":"Yang Y, Dong X, Cao Z, Shen J, Dou S (2023) Ixt: Improved searchable encryption for multi-word queries based on psi. Front Comp Sci 17:175811","journal-title":"Front Comp Sci"},{"key":"405_CR47","doi-asserted-by":"publisher","first-page":"107930","DOI":"10.1016\/j.future.2025.107930","volume":"174","author":"X Yang","year":"2026","unstructured":"Yang X, Li K, Qi S, Zhao H (2026) Practical volume-hiding range searchable symmetric encryption using trusted execution. Futur Gener Comput Syst 174:107930","journal-title":"Futur Gener Comput Syst"},{"key":"405_CR48","doi-asserted-by":"crossref","unstructured":"Zhu X et al (2025) A verifiable and efficient symmetric searchable encryption scheme for dynamic dataset with forward and backward privacy. IEEE Trans Dependable Secure Comput 22:2741\u20132755","DOI":"10.1109\/TDSC.2024.3521423"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00405-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00405-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00405-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:51:15Z","timestamp":1770285075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00405-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,6]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["405"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00405-8","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,6]]},"assertion":[{"value":"22 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 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":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"All authors agree to publish the paper and related research results of the paper.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publication"}},{"value":"We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"19"}}