The Community for Technology Leaders
2012 International Conference on Cloud and Service Computing (2012)
Shanghai, China China
Nov. 22, 2012 to Nov. 24, 2012
ISBN: 978-1-4673-4724-2
pp: 104-110
ABSTRACT
Nowadays, more and more people outsource their data to cloud servers for great flexibility and economic savings. Due to considerations on security, private data is usually protected by encryption before sending to cloud. How to utilize data efficiently while preserving user's privacy is a new challenge. In this paper, we focus on a efficient multi-keyword search scheme meeting a strict privacy requirement. First, we make a short review of two existing schemes supporting multi-keyword search, the kNN-based MRSE scheme and scheme based on bloom filter. Based on the kNN-based scheme, we propose an improved scheme. Our scheme adopt a product of three sparse matrix pairs instead of the original dense matrix pair to encrypt index, and thus get a significant improvement in efficiency. Then, we combine our improved scheme with bloom filter, and thus gain the ability for index updating. Simulation Experiments show proposed scheme indeed introduces low overhead on computation and storage.
INDEX TERMS
Secure KNN, Cloud Security, Privacy-preserving, Multi-keyword Search, Searchalbe Encryption
CITATION

C. Yang, W. Zhang, J. Xu, J. Xu and N. Yu, "A Fast Privacy-Preserving Multi-keyword Search Scheme on Cloud Data," 2012 International Conference on Cloud and Service Computing(CSC), Shanghai, China China, 2012, pp. 104-110.
doi:10.1109/CSC.2012.23
94 ms
(Ver 3.3 (11022016))