You are looking at a specific version 20150227:152640 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. 29th IFIP International Information Security and Privacy Conference (IFIP SEC 2014)
DOI
10.1007/978-3-642-55415-5_5
Keywords
searchable encryptionsecure cloud outsourcingmulti-keyword ranked searchhomomorphic encryption
Contact author(s)
strizhov @ cs colostate edu
History
2015-02-27: received
Short URL
https://ia.cr/2015/137
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.