Efficient dynamic multi-client searchable encryption supporting fuzzy search

Searchable symmetric encryption (SSE) enables the client to outsource its encrypted database to the untrusted server, while maintaining the ability to efficiently search over it. However, most of the existing solutions focus mainly on exact keyword search. That is, it will fail to fetch the desired result even though mild typos. To this end, SSE with fuzzy keyword search has attracted considerable concerns in the literature. We note that the current works support merely single-client setting. How to design fuzzy keyword search-based SSE scheme in the multi-client setting is still open. In this work, we first introduce a dynamic multi-client fuzzy keyword search scheme by employing Intel SGX, which can achieve forward privacy at the expense of multiple trapdoors communication. The proposed construction can reduce client-side computation and communication overload with the aid of Intel SGX. Furthermore, we present an enhanced multi-client fuzzy keyword search scheme that achieves forward privacy even in the presence of the corrupted user. The evaluation of security and efficiency indicates that our schemes are capable of meeting the desired security level and are well-suited for real-world applications.

Automated summary

This article introduces a searchable symmetric encryption (SSE) scheme using fuzzy keyword search. A dynamic multi-client scheme is proposed in a single-client setting, achieving forward privacy with multiple trapdoors communication using Intel SGX. Additionally, an enhanced multi-client scheme is presented that achieves forward privacy even with a corrupted user. Security and efficiency evaluations show that these schemes meet the desired security level and are well-suited for real-world applications.