Dynamic Symmetric Searchable Encryption (DSSE) enables secure storage of encrypted data on a cloud server while supporting dynamic updates and keyword searches. Two key security concepts, forward privacy and backward privacy, ensure that searchable encryption minimizes the exposure of sensitive information to the server. Currently, most existing searchable encryption schemes only support single-keyword queries, and reusing single-keyword searches to achieve conjunctive keyword queries will significantly decrease query efficiency. This paper proposes a novel approach to tackle this issue, which enhances the efficiency of conjunctive keyword queries by including all keyword information of documents within a single encrypted entry. Furthermore, by merging the previously updated keys into subsequent updated data, the client’s computational overhead during queries is reduced as well as the amount of state information that the client needs to maintain. Compared with ODXT, our scheme achieves less information leakage, higher query efficiency, and lower communication overhead.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Dynamic Symmetric Searchable Encryption Scheme for Rapid Conjunctive Queries

  • Zekun Zou,
  • Ruirui Gao,
  • Xiong Li,
  • Xiaofen Wang,
  • Xiaosong Zhang

摘要

Dynamic Symmetric Searchable Encryption (DSSE) enables secure storage of encrypted data on a cloud server while supporting dynamic updates and keyword searches. Two key security concepts, forward privacy and backward privacy, ensure that searchable encryption minimizes the exposure of sensitive information to the server. Currently, most existing searchable encryption schemes only support single-keyword queries, and reusing single-keyword searches to achieve conjunctive keyword queries will significantly decrease query efficiency. This paper proposes a novel approach to tackle this issue, which enhances the efficiency of conjunctive keyword queries by including all keyword information of documents within a single encrypted entry. Furthermore, by merging the previously updated keys into subsequent updated data, the client’s computational overhead during queries is reduced as well as the amount of state information that the client needs to maintain. Compared with ODXT, our scheme achieves less information leakage, higher query efficiency, and lower communication overhead.