Verifiable Searchable Symmetric Encryption Over Additive Homomorphism

作     者：Ji, Licheng Li, Jiguo Zhang, Yicheng Lu, Yang 

作者机构：Fujian Normal Univ Coll Comp & Cyber Secur Fuzhou 350117 Peoples R China Minist Educ Sch Math & Stat Fuzhou 350117 Fujian Peoples R China Minist Educ Key Lab Analyt Math & Applicat Fuzhou 350117 Fujian Peoples R China Fujian Prov Key Lab Network Secur & Cryptol Fuzhou 350117 Peoples R China Nanjing Normal Univ Sch Comp Sci & Technol Nanjing 210023 Peoples R China 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY》 (IEEE Trans. Inf. Forensics Secur.)

年 卷 期：2025年第20卷

页      面：1320-1332页

核心收录：

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

基　　金：National Natural Science Foundation of China [62072104, U21A20465] Open Research Fund of Key Laboratory of Analytical Mathematics and Applications, Fujian Normal University, Ministry of Education, China [JAM2407] 

主　　题：Verifiable searchable symmetric encryption search pattern access pattern response length pattern private set intersection conjunctive query leakage suppression 

摘      要：Searchable symmetric encryption (SSE) allows the client to search encrypted documents on an untrusted server without revealing the document content and queried keywords. To improve search efficiency and enrich expressiveness, most SSE schemes leak some information that could be exploited for attacks, characterized by leakage patterns. The traditional leakage patterns encompass the search pattern, the access pattern and the response length pattern. Recent research has demonstrated that these three patterns could be exploited to launch attacks, resulting in a high probability of compromising the confidentiality of encrypted documents and queried keywords. Moreover, while there exist SSE schemes that hide multiple leakage patterns, most of them do not resist the malicious server, which may carry out incorrect search operations. In this paper, we propose a leakage-suppressed verifiable SSE (VSSE) scheme that not only hides the three patterns but also allows the client to verify the server s response. We utilize the privacy set intersection based on polynomial coding and additive symmetric homomorphism encryption to construct a VSSE scheme that supports a conjunctive query. Specifically, we design an efficient random token generation algorithm to protect the search pattern and a verification algorithm that does not require server-generated proofs. Formal security analysis shows that our scheme achieves the desired correctness, security and verifiability. Lastly, we simulate the proposed scheme and compare it with the recent leakage suppression schemes in multiple aspects. The comparison results show that our scheme achieves a good balance in expressiveness, efficiency and security.