Volume 2 - Issue 1 – 2
A Verifiable Fuzzy Keyword Search Scheme Over Encrypted Data
- Jianfeng Wang
Department of Mathematics, Xidian University, China
wjf01@163.com
- Xiaofeng Chen
School of Telecommunications Engineering, Xidian University, China
xfchen@xidian.edu.cn
- Hua Ma
Department of Mathematics, Xidian University, China
ma_hua@126.com
- Qiang Tang
DIES, Faculty of EEMCS, University of Twente, the Netherlands
q.tang@utwente.nl
- Jin Li
Department of Computer Science, Guangzhou University, China
lijin@gzhu.edu.cn
- Hui Zhu
School of Telecommunications Engineering, Xidian University, China
zhuhui@xidian.edu.cn
Keywords: Searchable encryption, fuzzy keyword search, verifiability, cloud computing
Abstract
As the Cloud Computing technology becomes mature, the need increases rapidly to store sensitive
data securely on the cloud server. Since the cloud is not trusted, the data should be stored in an
encrypted form at the server. An inherent problem is how to query the encrypted data efficiently.
Recently, some searchable encryption schemes have been proposed in the literatures. Although the
existing searchable encryption schemes allow a user to search the encrypted data securely without
decrypting it, these solutions cannot support the verifiability of the search results. We argue that a
cloud server may be selfish in order to save its computation or download bandwidth. For example, it
may execute and return only a fraction of search operations and the results honestly. In this paper, we
propose a verifiable fuzzy keyword search scheme based on the symbol-tree which not only supports
the fuzzy keyword search over encrypted data, but also enjoys the verifiability of the search outcome.