计算机科学
加密
泄漏(经济)
对称密钥算法
并行计算
理论计算机科学
公钥密码术
计算机网络
计算机安全
算法
宏观经济学
经济
作者
Beining Wang,Yinuo Li,Jing Chen,Kun He,Meng Jia,Ruiying Du
标识
DOI:10.1109/tifs.2025.3592533
摘要
Dynamic searchable symmetric encryption (DSSE) enables updates and keyword searches on outsourced encrypted data while minimizing the information revealed to the server. However, existing DSSE schemes that support conjunctive keyword searches disclose added documents or fail to filter deleted ones in certain circumstances, thus violating forward and backward privacy. Besides, the size of their search tokens increases with the number of documents, which incurs a heavy communication cost. In this paper, we develop a conjunctive DSSE scheme that has a search token size only related to the conjunction size and fully supports forward and backward privacy. Our scheme is based on a new three-dimensional chain structure called CUBE. We also rethink the leakage function of conjunctive queries and prove that our scheme satisfies the refined security definition. Experimental results demonstrate that compared with the state-of-the-art schemes, our scheme increases the computational cost by at most 9.62% but reduces the communication cost by 99.78% when searching six conjunctive keywords.
科研通智能强力驱动
Strongly Powered by AbleSci AI