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

Örencik, Cengiz and Savaş, Erkay (2014) An efficient privacy-preserving multi-keyword search over encrypted cloud data with ranking. Distributed and Parallel Databases, 32 (1). pp. 119-160. ISSN 0926-8782 (Print) 1573-7578 (Online)

This is the latest version of this item.

[thumbnail of author cannot archive publisher's version/PDF] PDF (author cannot archive publisher's version/PDF)
Restricted to Repository staff only

Download (2MB) | Request a copy


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 efficient 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 effective 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, effective, and highly efficient.
Item Type: Article
Subjects: Q Science > QA Mathematics > QA076 Computer software
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Erkay Savaş
Date Deposited: 22 Jan 2014 11:44
Last Modified: 01 Aug 2019 14:26

Available Versions of this Item

Actions (login required)

View Item
View Item