An efficient privacy-preserving multi-keyword search over encrypted cloud data with ranking

Örencik, Cengiz and Savaş, Erkay (2012) An efficient privacy-preserving multi-keyword search over encrypted cloud data with ranking. (Submitted)

WarningThere is a more recent version of this item available.

PDF (This is a RoMEO green journal -- author can archive pre-print (ie pre-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


Information search and retrieval from a remote database (e.g., cloud server) involves a multitude of privacy issues. Submitted search terms and their frequencies, returned responses and order of their relevance, and retrieved data items may contain sensitive information about the users. In this paper, we propose an ecient multi-keyword search scheme that ensures users' privacy against both external adversaries including other authorized users and cloud server itself. The proposed scheme uses cryptographic techniques as well as query and response randomization. Provided that the security and randomization parameters are appropriately chosen, both search terms in queries and returned responses are protected against privacy violations. The scheme implements strict security and privacy requirements that essentially disallow linking queries featuring identical search terms. We also incorporate an eective ranking capability in the scheme that enables user to retrieve only the top matching results. Our comprehensive analytical study and extensive experiments using both real and synthetic datasets demonstrate that the proposed scheme is privacy-preserving, eective, and highly ecient.

Item Type:Article
Uncontrolled Keywords:Privacy-preserving keyword search, Cloud storage, Ranking
Subjects:Q Science > QA Mathematics > QA076 Computer software
ID Code:20664
Deposited By:Erkay Savaş
Deposited On:04 Dec 2012 23:14
Last Modified:22 Jan 2014 11:41

Available Versions of this Item

Repository Staff Only: item control page