Improved phrase search construction over encrypted data in cloud storage Online publication date: Mon, 27-Feb-2017
by Fanyu Kong; Jie Wang; Jia Yu; Xu An Wang
International Journal of Innovative Computing and Applications (IJICA), Vol. 8, No. 1, 2017
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com