Abstract
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.
Funding Information
  • National Key Research and Development Program of China (2022YFB3103300)
  • National Natural Science Foundation of China (62472323, 62172303)
  • Key Research and Development Program of Hubei Province (2024BAB018)
  • Wuhan Scientific and Technical Achievements Project (2024030803010172)
  • Key Research and Development Program of Shandong Province (2022CXPT055)
  • Wuhan Scientific and Technical Key Project (2023010302020707)

This publication has 29 references indexed in Scilit: