{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:08Z","timestamp":1740142748167,"version":"3.37.3"},"reference-count":32,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2020,12,26]],"date-time":"2020-12-26T00:00:00Z","timestamp":1608940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"National Cryptography Development","award":["MMJJ20180201"],"award-info":[{"award-number":["MMJJ20180201"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072181","61632012","61672239"],"award-info":[{"award-number":["62072181","61632012","61672239"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001744","name":"International Science and Technology Center","doi-asserted-by":"publisher","award":["61961146004"],"award-info":[{"award-number":["61961146004"]}],"id":[{"id":"10.13039\/501100001744","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Searchable encryption (SE) allows the cloud server to search over the encrypted data and leak information as little as possible. Most existing efficient SE schemes assume that the leakage of search pattern and access pattern is acceptable. A series of work was proposed, instructing malicious users to use this leakage to come up with attacks. Especially, with a devastating attack proposed by Zhang et al., the cloud server can reveal the keywords queried by normal users by using some injected files. From the method of constructing uniform $(k,n)$-set of a finite set $A$ proposed by Cao, we put forward a new file-injection attack. In our attack, the server needs fewer injected files than the previous attack when the size of $T$ is larger than 9 and the size of keyword set is larger than $2T$, where $T$ is the threshold of the number of keywords in each injected file. Our attack is more practical and easier to implement in the real scenario.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa161","type":"journal-article","created":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T12:09:33Z","timestamp":1603886973000},"page":"1264-1276","source":"Crossref","is-referenced-by-count":6,"title":["Improved File-injection Attacks on Searchable Encryption Using Finite Set Theory"],"prefix":"10.1093","volume":"64","author":[{"given":"Gaoli","family":"Wang","sequence":"first","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, China"},{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolei","family":"Dong","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2020,12,26]]},"reference":[{"key":"2021082513002668100_ref1","first-page":"1143","article-title":"$\\Sigma o\\phi o\\varsigma $-Forward Secure Searchable Encryption","volume-title":"Proc. ACM SIGSAC Conf. Computer and Communications Security (CCS 2016)","author":"Bost","year":"2016"},{"article-title":"Verifiable Dynamic Symmetric Searchable Encryption: Optimality and Forward Security","year":"2016","author":"Bost","key":"2021082513002668100_ref2"},{"key":"2021082513002668100_ref3","first-page":"1465","article-title":"Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives","volume-title":"Proc. ACM Conf. Computer and Communications Security (CCS 2017)","author":"Bost","year":"2017"},{"volume-title":"Public Key Cryptology","year":"1993","author":"Cao","key":"2021082513002668100_ref4"},{"key":"2021082513002668100_ref5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0378-3758(95)00076-3","article-title":"Finite set theory and its application to cryptology","volume":"51","author":"Cao","year":"1996","journal-title":"J. Statist. Plann. Inference"},{"key":"2021082513002668100_ref6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/978-3-642-40041-4_20","article-title":"Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries","volume-title":"Proc. Advances in Cryptology (CRYPTO 2013)","author":"Cash","year":"2013"},{"key":"2021082513002668100_ref7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.14722\/ndss.2014.23264","article-title":"Dynamic Searchable Encryption in Very Large Databases: Data Structures and Implementation","volume-title":"Proc. Network and Distributed System Security Symposium (NDSS 2014)","author":"Cash","year":"2014"},{"key":"2021082513002668100_ref8","first-page":"668","article-title":"Leakage-Abuse Attacks Against Searchable Encryption","volume-title":"Proc. ACM SIGSAC Conf. Computer and Communications Security (CCS 2015)","author":"Cash","year":"2015"},{"key":"2021082513002668100_ref9","first-page":"442","article-title":"Privacy Preserving Keyword Searches on Remote Encrypted Data","volume-title":"Proc. ACNS 2005","author":"Chang","year":"2005"},{"key":"2021082513002668100_ref10","first-page":"79","article-title":"Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions","volume-title":"Proc. ACM Conf. Computer and Communications Security (CCS 2006)","author":"Curtmola","year":"2006"},{"key":"2021082513002668100_ref11","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-319-96884-1_13","article-title":"Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency","volume-title":"Proc. CRYPTO 2018","author":"Demertzis","year":"2018"},{"key":"2021082513002668100_ref12"},{"key":"2021082513002668100_ref13","first-page":"1038","article-title":"New Constructions for Forward and Backward Private Symmetric Searchable Encryption","volume-title":"Proc. ACM SIGSAC Conf. Computer and Communications Security (CCS 2018)","author":"Ghareh Chamani","year":"2018"},{"article-title":"Secure Indexes","year":"2003","author":"Goh","key":"2021082513002668100_ref14"},{"key":"2021082513002668100_ref15","first-page":"1028","article-title":"ShadowCrypt: Encrypted Web Applications for Everyone","volume-title":"Proc. ACM SIGSAC Conf. Computer and Communications Security (CCS 2014)","author":"He","year":"2014"},{"key":"2021082513002668100_ref16","first-page":"5","article-title":"Access Pattern Disclosure on Searchable Encryption: Ramification, Attack and Mitigation","volume-title":"Proc. Network and Distributed System Security Symposium (NDSS 2012)","author":"Islam","year":"2012"},{"key":"2021082513002668100_ref17","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-642-39884-1_22","article-title":"Parallel and Dynamic Searchable Symmetric Encryption","volume-title":"Proc. Financial Cryptography and Data Security (FC 2013)","author":"Kamara","year":"2013"},{"key":"2021082513002668100_ref18","first-page":"965","article-title":"Dynamic Searchable Symmetric Encryption","volume-title":"Proc. ACM Conf. Computer and Communications Security (CCS 2012)","author":"Kamara","year":"2012"},{"key":"2021082513002668100_ref19","first-page":"1449","article-title":"Forward Secure Dynamic Searchable Symmetric Encryption with Efficient Updates","volume-title":"Proc. ACM Conf. Computer and Communications Security (CCS 2017)","author":"Kim","year":"2017"},{"key":"2021082513002668100_ref20","first-page":"33","article-title":"Mimesis Aegis: A Mimicry Privacy Shield\u2014A Systems Approach to Data Privacy on Public Cloud","volume-title":"Proc. USENIX Security Symposium\u2014USENIX Security 2014","author":"Lau","year":"2014"},{"key":"2021082513002668100_ref21","article-title":"Searchable symmetric encryption with forward search privacy","author":"Li","year":"2019","journal-title":"IEEE T. Depend. Secure Comput."},{"key":"2021082513002668100_ref22","first-page":"10","article-title":"Two new methods of distributive management of cryptographic key","volume":"8","author":"Liu","year":"1987","journal-title":"J. Commun."},{"key":"2021082513002668100_ref23","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.ins.2013.11.021","article-title":"Search pattern leakage in searchable encryption: Attacks and new construction","volume":"265","author":"Liu","year":"2014","journal-title":"Inf. Sci."},{"key":"2021082513002668100_ref24","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1109\/SP.2014.47","article-title":"Dynamic Searchable Encryption via Blind Storage","volume-title":"Proc. IEEE Symposium on Security and Privacy (S&P 2014)","author":"Naveed","year":"2014"},{"article-title":"The Fallacy of Composition of Oblivious RAM and Searchable Encryption","year":"2015","author":"Naveed","key":"2021082513002668100_ref25"},{"key":"2021082513002668100_ref26","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1109\/TIFS.2018.2866321","article-title":"Passive attacks against searchable encryption","volume":"14","author":"Ning","year":"2019","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"2021082513002668100_ref27","first-page":"44","article-title":"Practical Techniques for Searches on Encrypted Data","volume-title":"Proc. IEEE Symposium on Security and Privacy (S&P 2000)","author":"Song","year":"2000"},{"key":"2021082513002668100_ref28","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1109\/TDSC.2018.2822294","article-title":"Forward private searchable symmetric encryption with optimized i\/o efficiency","volume":"17","author":"Song","year":"2018","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"2021082513002668100_ref29","doi-asserted-by":"crossref","first-page":"23","DOI":"10.14722\/ndss.2014.23298","article-title":"Practical Dynamic Searchable Encryption with Small Leakage","volume-title":"Proc. Network and Distributed System Security Symposium (NDSS 2014)","author":"Stefanov","year":"2014"},{"key":"2021082513002668100_ref30","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1093\/comjnl\/bxy108","article-title":"Improved fault-tolerant aggregate signatures","volume":"62","author":"Wang","year":"2019","journal-title":"Comput. J."},{"key":"2021082513002668100_ref31","first-page":"101","article-title":"Order-Revealing Encryption: File-Injection Attack and Forward Security","volume-title":"Proc. ESORICS 2018","author":"Wang","year":"2018"},{"key":"2021082513002668100_ref32","first-page":"707","article-title":"All Your Queries are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption","volume-title":"Proc. USENIX Security Symposium 2016","author":"Zhang","year":"2016"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/8\/1264\/39904343\/bxaa161.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/8\/1264\/39904343\/bxaa161.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T13:01:14Z","timestamp":1629896474000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/64\/8\/1264\/6048928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,26]]},"references-count":32,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2020,12,26]]},"published-print":{"date-parts":[[2021,8,25]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa161","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2021,8]]},"published":{"date-parts":[[2020,12,26]]}}}