期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2016
卷号：5
期号：3
页码：3532
DOI：10.15680/IJIRSET.2016.0503146
出版社：S&S Publications
摘要：With the advent of cloud computing, data owners are motivated to outsource their complex datamanagement systems from local sites to the commercial public cloud for great flexibility and economic savings. But forprotecting data privacy, sensitive data have to be encrypted before outsourcing, which obsoletes traditional datautilization based on plaintext keyword search. Thus, enabling an encrypted cloud data search service is of paramountimportance. Considering the large number of data users and documents in the cloud, it is necessary to allow multiplekeywords in the search request and return documents in the order of their relevance to these keywords. Related workson searchable encryption focus on single keyword search or Boolean keyword search, and rarely sort the search results.In this paper, for the first time, we define and solve the challenging problem of privacy-preserving multi-keywordranked search over encrypted data in cloud computing (MRSE). We establish a set of strict privacy requirements forsuch a secure cloud data utilization system. Among various multi-keyword semantics, we choose the efficient similaritymeasure of “coordinate matching,” i.e., as many matches as possible, to capture the relevance of data documents to thesearch query. We further use “inner product similarity” to quantitatively evaluate such similarity measure. We firstpropose a basic idea for the MRSE based on secure inner product computation, and then give two significantlyimproved MRSE schemes to achieve various stringentrequirements in two different threat models. To improve searchexperience of the data search service, we further extend these two schemes to support more search semantics. Thoroughanalysis investigating privacy and efficiency guarantees of proposed schemes is given. Experiments on the real-worlddata set further show proposed schemes indeed introduce low overhead on computation and communication.
