Cryptology ePrint Archive: Report 2015/137

Multi-keyword Similarity Search Over Encrypted Cloud Data

Mikhail Strizhov and Indrajit Ray

Abstract: Searchable encryption allows one to upload encrypted documents on a remote honest-but-curious server and query that data at the server itself without requiring the documents to be decrypted prior to searching. In this work, we propose a novel secure and efficient multi-keyword similarity searchable encryption (MKSim) that returns the matching data items in a ranked ordered manner. Unlike all previous schemes, our search complexity is sublinear to the total number of documents that contain the queried set of keywords. Our analysis demonstrates that proposed scheme is proved to be secure against adaptive chosen-keyword attacks. We show that our approach is highly efficient and ready to be deployed in the real-world cloud storage systems.

Category / Keywords: cryptographic protocols / searchable encryption, secure cloud outsourcing, multi-keyword ranked search, homomorphic encryption

Original Publication (in the same form): 29th IFIP International Information Security and Privacy Conference (IFIP SEC 2014)
DOI:
10.1007/978-3-642-55415-5_5

Date: received 19 Feb 2015

Contact author: strizhov at cs colostate edu

Available format(s): PDF | BibTeX Citation

Version: 20150227:152640 (All versions of this report)

Short URL: ia.cr/2015/137

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]