Efficient and secure ranked multi-keyword search on encrypted cloud data

Örencik, Cengiz and Savaş, Erkay (2012) Efficient and secure ranked multi-keyword search on encrypted cloud data. In: 2012 Joint EDBT/ICDT Workshops , Berlin, Germany

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1145/2320765.2320820


Information search and document retrieval from a remote database (e.g. cloud server) requires submitting the search terms to the database holder. However, the search terms may contain sensitive information that must be kept secret from the database holder. Moreover, the privacy concerns apply to the relevant documents retrieved by the user in the later stage since they may also contain sensitive data and reveal information about sensitive search terms. A related protocol, Private Information Retrieval (PIR), provides useful cryptographic tools to hide the queried search terms and the data retrieved from the database while returning most relevant documents to the user. In this paper, we propose a practical privacy-preserving ranked keyword search scheme based on PIR that allows multi-keyword queries with ranking capability. The proposed scheme increases the security of the keyword search scheme while still satisfying efficient computation and communication requirements. To the best of our knowledge the majority of previous works are not efficient for assumed scenario where documents are large files. Our scheme outperforms the most efficient proposals in literature in terms of time complexity by several orders of magnitude.

Item Type:Papers in Conference Proceedings
Subjects:Q Science > QA Mathematics > QA076 Computer software
ID Code:20671
Deposited By:Erkay Savaş
Deposited On:05 Dec 2012 13:47
Last Modified:31 Jul 2019 15:46

Repository Staff Only: item control page