A Verifiable and Efficient Symmetric Searchable Encryption Scheme for Dynamic Dataset With Forward and Backward Privacy

作     者：Zhu, Xiaojie Zhou, Jiancong Dai, Yueyue Shen, Peisong Kermanshahi, Shabnam Kasra Hu, Jiankun 

作者机构：King Abdullah Univ Sci & Technol Thuwal 23955 Saudi Arabia Chinese Acad Sci Inst Informat Engn Beijing 100045 Peoples R China Univ Chinese Acad Sci Sch Cyber Secur Beijing 101408 Peoples R China Huazhong Univ Sci & Technol Sch Cyber Sci & Engn Wuhan 430074 Peoples R China Univ New South Wales Sch Syst & Comp Canberra NSW 2600 Australia 

出 版 物：《IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING》 (IEEE Trans. Dependable Secure Comput.)

年 卷 期：2025年第22卷第3期

页      面：2741-2755页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Indexes Privacy Cryptography Encryption Cloud computing Dictionaries Sharding Software Servers Data privacy Symmetric searchable encryption dynamic dataset verification efficiency cloud 

摘      要：The adoption of symmetric searchable encryption (SSE) has become increasingly common. However, many current SSE schemes assume an honest-but-curious cloud service provider (CSP) or necessitate significant overhead to manage a malicious CSP. Furthermore, most of these schemes are tailored for static datasets. Our paper presents an efficient SSE scheme that aims to address these challenges. To the best of our knowledge, this is the first scheme that supports dynamic datasets with forward and backward privacy, integrity verification of non-empty and empty search results, efficient search, non-interactive, light client, and both forward and inverted indexes simultaneously. In this paper, we present two novel approaches, Hexie and Jianding. Hexie implements secret sharing to conceal index entries, enabling dynamic updates, non-interactive interactions, and lightweight clients. To enhance the reliability of search results and address the problem of empty, incomplete, or inaccurate outcomes, we introduce the Jianding scheme as an extension of Hexie. It combines a chained MAC structure with a secret sharing scheme, which enables a client to verify the data integrity of the search result efficiently. Moreover, we propose graph-based dictionary sharding to enhance search efficiency. Finally, we conduct comprehensive experiments to validate the effectiveness of the proposed schemes.