A New Efficient Verifiable Fuzzy Keyword
Search Scheme
Jianfeng Wang1, Hua Ma1,
Qiang Tang2, Jin Li3, Hui Zhu1, Siqi Ma1,
and Xiaofeng Chen1+
1Xidian University, China
wjf01@163.com, mahua@126.com, zhuhui@xidian.edu.cn, xdmasiqi@hotmail.com,
xfchen@xidian.edu.cn
2APSIA group, SnT, University of Luxembourg
6, rue Richard Coudenhove-Kalergi
L-1359 Luxembourg
qiang.tang@uni.lu
3School of Computer Science
Guangzhou University, China
jinli71@gmail.com
Abstract
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.
Keywords: cloud computing, searchable encryption, verifiable
fuzzy keyword search, data privacy
+: Corresponding author: State Key Laboratory of ISN, Xidian
University, Xi'an 710071, P.R.China, Tel: +86-29-88204749
Journal of Wireless Mobile Networks,
Ubiquitous Computing, and Dependable Applications (JoWUA),
Vol. 3, No. 4, pp. 61-71, December 2012
[pdf]