Authors: Fanyu Kong; Jie Wang; Jia Yu; Xu An Wang
Addresses: Institute of Network Security, Shandong University, Jinan 250100, China; Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Jinan 250100, China ' Department of Computer Science, University of Massachusetts Lowell, Lowell, MA 01854, USA ' College of Information Engineering, Qingdao University, Qingdao 266071, China ' Department of Electronics Technology, Engineering University of Armed Police Force, Xi'an, China
Abstract: Searchable encryption schemes are important security techniques for guaranteeing cloud customers' data privacy in cloud storage outsourcing service. Kissel proposed a verifiable single-phase phrase search scheme using symmetric encryption algorithms, which was proved non-adaptively secure in the semi-honest-but-curious (SHBC) model. We present a security analysis of Kissel's scheme and show that the cloud service provider can obtain some new phrases' trapdoors and search outcomes based on the client's a phrase query. We propose an improvement to simplify Kissel's scheme and enhance its security. Finally, we give a security analysis and efficiency analysis of the improved phrase search scheme on encrypted data. The analysis shows that our improved scheme is proved non-adaptively secure and has better efficiency.
Keywords: cloud storage; big data; searchable symmetric encryption; SSE; phrase search; encrypted data; cloud computing; cloud security; data privacy; privacy protection; privacy preservation; cryptography.
International Journal of Innovative Computing and Applications, 2017 Vol.8 No.1, pp.3 - 11
Available online: 18 Feb 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article