Volume 3 - Issue 4
A New Efficient Verifiable Fuzzy Keyword Search Scheme
- Jianfeng Wang
Department of Mathematics Xidian University, China
wjf01@163.com
- Hua Ma
Department of Mathematics Xidian University, China
mahua@126:com
- Qiang Tang
APSIA group, SnT, University of Luxembourg 6, rue Richard Coudenhove-Kalergi L-1359 Luxembourg
qiang.tang@uni.lu
- Jin Li
School of Computer Science Guangzhou University, China
jinli71@gmail.com
- Hui Zhu
State Key Laboratory of ISN Network and Data Security Key Laboratory of Sichuan Province Xidian University, China
zhuhui@xidian.edu.cn
- Siqi Ma
School of Computer Science and Technology Xidian University, China
xdmasiqi@hotmail.com
- Xiaofeng Chen
State Key Laboratory of ISN Xidian University, China
xfchen@xidian.edu.cn
Keywords: Cloud computing, searchable encryption, verifiable fuzzy keyword search, data privacy
Abstract
Data outsourcing has attracted considerable attentions recently. It can not only bring high quality data
service to users, it also reduces their burden of data storage and maintenance. As the confidentiality
of sensitive data, it should be encrypted before outsourcing. To achieve search over the encrypted
data becomes a challenging problem. Although the existing searchable encryption schemes allow
users 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 novel verifiable fuzzy keyword search scheme based
on the bloom filter which can support the fuzzy keyword search, while enjoying the verifiability of
the searching result. Through rigorous security analysis, we show that our proposed scheme is secure
under the proposed model, while correctly and efficiently realizing the verifiable fuzzy keyword
search.