Efficient verifiable fuzzy keyword search over encrypted data in cloud computing

By Jin Li, Qian Wang, Ning Cao, Kui Ren, Wenjing Lou. Computer Science and Information Systems, 2013

632 citations recorded by the source corpus.

As cloud computing becomes prevalent, more and more sensitive data is being centralized into the cloud by users. To maintain the confidentiality of sensitive user data against untrusted servers, the data should be encrypted before they are uploaded. However, this raises a new challenge for performing search over the encrypted data efficiently. Although the existing searchable encryption schemes allow a user to search the encrypted data with confidentiality, these solutions cannot support the verifiability of searching result. We argue that a cloud server may be selfish in order to save its computation ability or bandwidth. For example, it may execute only a fraction of the search and returns part of the searching result. In this paper, we propose a new verifiable fuzzy keyword search scheme based on the symbol-tree which not only supports the fuzzy keyword search, but also enjoys the verifiability of the searching result. Through rigorous security and efficiency analysis, we show that our proposed scheme is secure under the proposed model, while correctly and efficiently realizing the verifiable fuzzy keyword search. The extensive experimental results demonstrate the efficiency of the proposed scheme.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/e27d5122a0ee36d82d3d4b64647134d19e156189

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Xinhui Wang
2. Xingming Sun
3. Zhihua Xia

In Information Systems

1. Xinhui Wang
2. Xingming Sun
3. Zhihua Xia

Citations in the corpus

• A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data (2016, background): “[10] proposed two schemes (SSE-1 and SSE-2) which achieve the optimal search time.”
• Secure k-nearest neighbor query over encrypted data in outsourced environments (2013, neutral): “We emphasize that such an assumption is not new and has been commonly used in the related problem domains [3, 26].”