{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T07:32:39Z","timestamp":1769758359352,"version":"3.49.0"},"reference-count":29,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T00:00:00Z","timestamp":1633651200000},"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>Verifiable symmetric searchable encryption is a keyword search technology that supports verification of search results. Many schemes improve search performance by dividing each keyword label into segments and storing them in a Trie-tree at the expense of high storage. And the index will degenerate into a linear linked list when all keyword labels have the same prefix except for the last segment. But it will greatly affect the search efficiency. In this paper, we propose a verifiable symmetric searchable encryption scheme based on the AVL Tree (abbreviated as VSSE-AVL), which uses complete keyword labels to build the index. Compared with the Trie-tree index, VSSE-AVL not only balances storage and search performance, but also avoids degradation. To verify the correctness and completeness of empty search results, we store path information in each leaf node and node with only one child node. Considering the substitution attack, we bind the file identifier and the file so that the client will find out once the server returns inconsistent search results. Rigorous security analysis shows VSSE-AVL satisfies privacy and verifiability. Compared with the verifiable SSE-2 with the same security, the experimental evaluation shows that our proposed scheme performs better on storage, search and verification.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab152","type":"journal-article","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T19:12:39Z","timestamp":1631905959000},"page":"174-183","source":"Crossref","is-referenced-by-count":13,"title":["A Verifiable Symmetric Searchable Encryption Scheme Based on the AVL Tree"],"prefix":"10.1093","volume":"66","author":[{"given":"Qing","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics , Shandong University, Jinan, Shandong 250100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematics , Shandong University, Jinan, Shandong 250100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Qin","sequence":"additional","affiliation":[{"name":"School of Mathematics , Shandong University, Jinan, Shandong 250100, 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":"Jixin","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Computing and Mathematical Sciences University of Greenwich , London,UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyi","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Informatics , Fujian Normal University, Fuzhou, Fujian 350117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,10,8]]},"reference":[{"key":"2023011814194276500_ref1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/CloudCom.2011.55","article-title":"A cloud environment for data-intensive storage services","volume-title":"2011 IEEE third international conference on cloud computing technology and science","author":"Kolodner","year":"2011"},{"key":"2023011814194276500_ref2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1147\/JRD.2014.2302381","article-title":"Efficient and agile storage management in software defined environments","volume":"58","author":"Alba","year":"2014","journal-title":"IBM Journal of Research and Development"},{"key":"2023011814194276500_ref3","volume-title":"Data leakage attacks grew by 93 percent in 2020","author":"Teiss","year":"2021"},{"key":"2023011814194276500_ref4","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":"2023011814194276500_ref5","article-title":"Secure indexes. Cryptology ePrint Archive, Report 2003\/216","author":"Goh","year":"2003"},{"key":"2023011814194276500_ref6","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":"2023011814194276500_ref7","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":"2023011814194276500_ref8","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1109\/TDSC.2019.2894411","article-title":"Searchable symmetric encryption with forward search privacy","volume":"18","author":"Li","year":"2019","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"2023011814194276500_ref9","doi-asserted-by":"crossref","first-page":"1795","DOI":"10.1109\/TIFS.2020.3042058","article-title":"Sap-sse: Protecting search patterns and access patterns in searchable symmetric encryption","volume":"16","author":"Song","year":"2020","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"2023011814194276500_ref10","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/ICC.2012.6364125","article-title":"Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers","volume-title":"2012 IEEE International Conference on Communications (ICC)","author":"Chai","year":"2012"},{"key":"2023011814194276500_ref11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-642-32946-3_21","article-title":"Uc-secure searchable symmetric encryption","volume-title":"International Conference on Financial Cryptography and Data Security","author":"Kurosawa","year":"2012"},{"key":"2023011814194276500_ref12","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1109\/INFOCOM.2018.8485890","article-title":"Searching an encrypted cloud meets blockchain: A decentralized, reliable and fair realization","volume-title":"IEEE INFOCOM 2018-IEEE Conference on Computer Communications","author":"Hu","year":"2018"},{"key":"2023011814194276500_ref13","doi-asserted-by":"crossref","first-page":"667","DOI":"10.2298\/CSIS121104028W","article-title":"Efficient verifiable fuzzy keyword search over encrypted data in cloud computing","volume":"10","author":"Wang","year":"2013","journal-title":"Computer science and information systems"},{"key":"2023011814194276500_ref14","doi-asserted-by":"crossref","first-page":"3025","DOI":"10.1109\/TPDS.2013.282","article-title":"Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking","volume":"25","author":"Sun","year":"2014","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2023011814194276500_ref15","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1109\/TPDS.2018.2808283","article-title":"Enabling generic, verifiable, and secure data search in cloud services","volume":"29","author":"Zhu","year":"2018","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2023011814194276500_ref16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-3-319-02937-5_17","article-title":"How to update documents verifiably in searchable symmetric encryption","volume-title":"International Conference on Cryptology and Network Security","author":"Kurosawa","year":"2013"},{"key":"2023011814194276500_ref17","first-page":"135","article-title":"Improvement of uc secure searchable symmetric encryption scheme","volume-title":"International Workshop on Security","author":"Taketani","year":"2015"},{"key":"2023011814194276500_ref18","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/978-3-319-27137-8_47","article-title":"Verifiable dynamic fuzzy search over encrypted data in cloud computing","volume-title":"International Conference on Algorithms and Architectures for Parallel Processing","author":"Zhu","year":"2015"},{"key":"2023011814194276500_ref19","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1109\/TDSC.2018.2876831","article-title":"Multi-user verifiable searchable symmetric encryption for cloud storage","volume":"17","author":"Liu","year":"2018","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"2023011814194276500_ref20","first-page":"593","article-title":"Enabling efficient fuzzy keyword search over encrypted data in cloud computing","volume":"2009","author":"Li","year":"2009","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2023011814194276500_ref21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24676-3_30","article-title":"Public key encryption with keyword search","volume-title":"International conference on the theory and applications of cryptographic techniques","author":"Boneh","year":"2004"},{"key":"2023011814194276500_ref22","first-page":"205","article-title":"Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions","volume-title":"Annual international cryptology conference","author":"Abdalla","year":"2005"},{"key":"2023011814194276500_ref23","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","article-title":"Conjunctive, subset, and range queries on encrypted data","volume-title":"Theory of cryptography conference","author":"Boneh","year":"2007"},{"key":"2023011814194276500_ref24","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/TDSC.2016.2635128","article-title":"Vpsearch: achieving verifiability for privacy-preserving multi-keyword search over encrypted cloud data","volume":"15","author":"Wan","year":"2016","journal-title":"IEEE transactions on dependable and secure computing"},{"key":"2023011814194276500_ref25","first-page":"336","article-title":"Practical homomorphic macs for arithmetic circuits","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Catalano","year":"2013"},{"key":"2023011814194276500_ref26","doi-asserted-by":"crossref","first-page":"3293","DOI":"10.1109\/TC.2015.2401036","article-title":"Verifiable auditing for outsourced database in cloud computing","volume":"64","author":"Wang","year":"2015","journal-title":"IEEE transactions on computers"},{"key":"2023011814194276500_ref27","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.future.2016.05.002","article-title":"Towards achieving flexible and verifiable search for outsourced database in cloud computing","volume":"67","author":"Wang","year":"2017","journal-title":"Future Generation Computer Systems"},{"key":"2023011814194276500_ref28","first-page":"263","article-title":"An algorithm for the organization of information. Dokl. Akad","volume":"146","author":"Adelson-Velskij","year":"1962","journal-title":"Nauk SSSR"},{"key":"2023011814194276500_ref29","article-title":"Left-leaning red-black trees","author":"Sedgewick","year":"2008","journal-title":"Dagstuhl Workshop on Data Structures"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/1\/174\/48729121\/bxab152.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/1\/174\/48729121\/bxab152.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T14:20:07Z","timestamp":1674051607000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/1\/174\/6384776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,8]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,10,8]]},"published-print":{"date-parts":[[2023,1,17]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab152","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,8]]}}}