Visible to the public A privacy-preserving multi-keyword ranked search scheme over encrypted cloud data using MIR-tree

TitleA privacy-preserving multi-keyword ranked search scheme over encrypted cloud data using MIR-tree
Publication TypeConference Paper
Year of Publication2016
AuthorsGurjar, S. P. S., Pasupuleti, S. K.
Conference Name2016 International Conference on Computing, Analytics and Security Trends (CAST)
Date Publisheddec
Keywordsauthenticated data structure, authentication, ciphertext search, cloud computing, cloud data, communication overhead reduction, composability, cryptography, data integrity, data privacy, database indexing, encrypted cloud data, index construction, Indexes, inverted file index, Metrics, MIR-tree, MIR-tree based index, multi-keyword ranked search, optimal search efficiency, Outsourced Database Integrity, outsourcing, Privacy-preserving, privacy-preserving multikeyword ranked search, pubcrawl, query generation, query processing, Resiliency, sensitive data outsourcing, Servers, TF×IDF model, top-k search, trapdoor, tree data structures, vector space model, word-digest

With increasing popularity of cloud computing, the data owners are motivated to outsource their sensitive data to cloud servers for flexibility and reduced cost in data management. However, privacy is a big concern for outsourcing data to the cloud. The data owners typically encrypt documents before outsourcing for privacy-preserving. As the volume of data is increasing at a dramatic rate, it is essential to develop an efficient and reliable ciphertext search techniques, so that data owners can easily access and update cloud data. In this paper, we propose a privacy preserving multi-keyword ranked search scheme over encrypted data in cloud along with data integrity using a new authenticated data structure MIR-tree. The MIR-tree based index with including the combination of widely used vector space model and TFxIDF model in the index construction and query generation. We use inverted file index for storing word-digest, which provides efficient and fast relevance between the query and cloud data. Design an authentication set(AS) for authenticating the queries, for verifying top-k search results. Because of tree based index, our scheme achieves optimal search efficiency and reduces communication overhead for verifying the search results. The analysis shows security and efficiency of our scheme.

Citation Keygurjar_privacy-preserving_2016