{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:37:14Z","timestamp":1779896234736,"version":"3.53.1"},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:00:00Z","timestamp":1633910400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072276"],"award-info":[{"award-number":["62072276"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772311"],"award-info":[{"award-number":["61772311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,1,17]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Multi-keyword ranked searchable encryption (MRSE) supports multi-keyword contained in one query and returns the top-k search results related to the query keyword set. It realized effective search on encrypted data. Most previous works about MRSE can only make the complete keyword search and rank on the server-side. However, with more practice, users may not be able to express some keywords completely when searching. Server-side ranking increases the possibilities of the server inferring some keywords queried, leading to the leakage of the user\u2019s sensitive information. In this paper, we propose a new MRSE system named \u2018multi-keyword ranked searchable encryption with the wildcard keyword (MRSW)\u2019. It allows the query keyword set to contain a wildcard keyword by using Bloom filter (BF). Using hierarchical clustering algorithm, a clustering Bloom filter tree (CBF-Tree) is constructed, which improves the efficiency of wildcard search. By constructing a modified inverted index (MII) table on the basis of the term frequency-inverse document frequency (TF-IDF) rule, the ranking function of MRSW is performed by the user. MRSW is proved secure under adaptive chosen-keyword attack (CKA2) model, and experiments on a real data set from the web of science indicate that MRSW is efficient and practical.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab153","type":"journal-article","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T19:12:39Z","timestamp":1631905959000},"page":"184-196","source":"Crossref","is-referenced-by-count":18,"title":["Multi-Keyword Ranked Searchable Encryption with the Wildcard Keyword for Data Sharing in Cloud Computing"],"prefix":"10.1093","volume":"66","author":[{"given":"Jinlu","family":"Liu","sequence":"first","affiliation":[{"name":"School of Mathematics , Shandong University, Jinan, 250100 Shandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Mathematics , Shandong University, Jinan, 250100 Shandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Qin","sequence":"additional","affiliation":[{"name":"School of Mathematics , Shandong University, Jinan, 250100 Shandong, China"},{"name":"State Key Laboratory of Information Security , Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xi","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematics , Shandong University, Jinan, 250100 Shandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jixin","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Computing and Mathematical Sciences University of Greenwich , London,UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"key":"2023011814194594300_ref1","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/SECPRI.2000.848445","article-title":"Practical techniques for searches on encrypted data","volume-title":"Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000","author":"Song","year":"2000"},{"key":"2023011814194594300_ref2","first-page":"216","article-title":"Secure indexes","volume":"2003","author":"Goh","year":"2003","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2023011814194594300_ref3","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/11496137_30","article-title":"Privacy preserving keyword searches on remote encrypted data","volume-title":"International conference on applied cryptography and network security","author":"Chang","year":"2005"},{"key":"2023011814194594300_ref4","doi-asserted-by":"crossref","first-page":"895","DOI":"10.3233\/JCS-2011-0426","article-title":"Searchable symmetric encryption: improved definitions and efficient constructions","volume":"19","author":"Curtmola","year":"2011","journal-title":"Journal of Computer Security"},{"key":"2023011814194594300_ref5","first-page":"829","article-title":"Privacy-preserving multi-keyword ranked search over encrypted cloud data","volume-title":"INFOCOM 2011. 30th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies","author":"Ning","year":"2011"},{"key":"2023011814194594300_ref6","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/TPDS.2013.45","article-title":"Privacy-preserving multi-keyword ranked search over encrypted cloud data","volume":"25","author":"Cao","year":"2013","journal-title":"IEEE Transactions on parallel and distributed systems"},{"key":"2023011814194594300_ref7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/TDSC.2013.9","article-title":"Toward secure multikeyword top-k retrieval over encrypted cloud data","volume":"10","author":"Yu","year":"2013","journal-title":"IEEE transactions on dependable and secure computing"},{"key":"2023011814194594300_ref8","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/TPDS.2015.2425407","article-title":"An efficient privacy-preserving ranked keyword search method","volume":"27","author":"Chen","year":"2015","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2023011814194594300_ref9","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","article-title":"A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data","volume":"27","author":"Xia","year":"2015","journal-title":"IEEE transactions on parallel and distributed systems"},{"key":"2023011814194594300_ref10","doi-asserted-by":"crossref","first-page":"35826","DOI":"10.1109\/ACCESS.2019.2904763","article-title":"Dynamic multi-keyword ranked search based on bloom filter over encrypted cloud data","volume":"7","author":"Guo","year":"2019","journal-title":"IEEE Access"},{"key":"2023011814194594300_ref11","doi-asserted-by":"crossref","first-page":"2112","DOI":"10.1109\/INFOCOM.2014.6848153","article-title":"Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud","volume-title":"IEEE INFOCOM 2014-IEEE Conference on Computer Communications","author":"Wang","year":"2014"},{"key":"2023011814194594300_ref12","doi-asserted-by":"crossref","first-page":"2706","DOI":"10.1109\/TIFS.2016.2596138","article-title":"Toward efficient multi-keyword fuzzy search over encrypted outsourced data with accuracy improvement","volume":"11","author":"Fu","year":"2016","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"2023011814194594300_ref13","article-title":"A novel fuzzy search approach over encrypted data with improved accuracy and efficiency","author":"Cao","year":"2019"},{"key":"2023011814194594300_ref14","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10207-015-0302-0","article-title":"Efficient wildcard search over encrypted data","volume":"15","author":"Hu","year":"2016","journal-title":"International Journal of Information Security"},{"key":"2023011814194594300_ref15","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/TSC.2017.2714669","article-title":"Flexible wildcard searchable encryption system","volume":"13","author":"Yang","year":"2017","journal-title":"IEEE Transactions on Services Computing"},{"key":"2023011814194594300_ref16","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-642-15317-4_10","article-title":"Searching keywords with wildcards on encrypted data","volume-title":"International Conference on Security and Cryptography for Networks","author":"Sedghi","year":"2010"},{"key":"2023011814194594300_ref17","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/978-3-642-23556-6_8","article-title":"Conjunctive wildcard search over encrypted data","volume-title":"Workshop on Secure Data Management","author":"B\u00f6sch","year":"2011"},{"key":"2023011814194594300_ref18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-33272-2_15","article-title":"Secure keyword search using bloom filter with specified character positions","volume-title":"International Conference on Provable Security","author":"Suga","year":"2012"},{"key":"2023011814194594300_ref19","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/978-3-319-46298-1_18","article-title":"Searchable symmetric encryption supporting queries with multiple-character wildcards","volume-title":"International Conference on Network and System Security","author":"Zhao","year":"2016"},{"key":"2023011814194594300_ref20","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/time trade-offs in hash coding with allowable errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Communications of the ACM"},{"key":"2023011814194594300_ref21","first-page":"577","article-title":"Structured encryption and controlled disclosure","volume-title":"International conference on the theory and application of cryptology and information security","author":"Chase","year":"2010"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/1\/184\/48729144\/bxab153.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/1\/184\/48729144\/bxab153.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T14:20:38Z","timestamp":1674051638000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/1\/184\/6384775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,11]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,10,11]]},"published-print":{"date-parts":[[2023,1,17]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab153","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,1]]},"published":{"date-parts":[[2021,10,11]]}}}