Multi-keyword Similarity Search over Encrypted Cloud Data

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 e

  • PDF / 347,053 Bytes
  • 14 Pages / 439.363 x 666.131 pts Page_size
  • 31 Downloads / 233 Views

DOWNLOAD

REPORT


{strizhov,indrajit}@CS.ColoState.EDU

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. Keywords: searchable encryption, secure cloud outsourcing, multi-keyword ranked search, homomorphic encryption.

1 Introduction Cloud computing enables new types of services where the computational and network resources are available online through the Internet. One of the most popular services of cloud computing is data outsourcing. For reasons of cost and convenience, public as well as private organizations can now outsource their large amounts of data to the cloud and enjoy the benefits of remote storage. At the same time, confidentiality of remotely stored data on untrusted cloud server is a big concern. In order to reduce these concerns, sensitive data, such as, personal health records, emails, income tax and financial reports, etc. are usually outsourced in encrypted form using well-known cryptographic techniques. Although encrypted data storage protects remote data from unauthorized access, it complicates some basic, yet essential data utilization services such as plaintext keyword search. A simple solution of downloading the data, decrypting and searching locally is clearly inefficient since storing data in the cloud is meaningless unless it can be easily searched and utilized. Thus, cloud services should enable efficient search on encrypted data to provide the benefits of a first-class cloud computing environment. Researchers have investigated this problem quite extensively in the context of encrypted documents [1–6, 9, 10, 12, 13, 16, 20, 23, 25, 26]. Solutions generally involve 

This work was partially supported by the U.S. National Science Foundation under Grant No. 0905232

N. Cuppens-Boulahia et al. (Eds.): SEC 2014, IFIP AICT 428, pp. 52–65, 2014. © IFIP International Federation for Information Processing 2014

Multi-keyword Similarity Search over Encrypted Cloud Data

53

building an encrypted searchable index such that its content is hidden from the remote server yet allowing the corresponding documents to be searched. These solutions differ from each other mostly in terms of whether they allow single keyword search or multikeyword search and the types of techniques they use to build the trapdoor function. A few of them, most notably [4,5,9,25], allow the notion of similarity search. The similarity search problem con