Paper Details

— A Secure and Dynamic Multi-keyword Ranked explore Scheme over Encrypted Cloud Data Due to theincreasing regard of cloud computing, more and more data owners are motivated to outsource their data to cloud serversfor great convenience and reduced cost in data management. However, sensitive data should be encrypted beforeoutsourcing for privacy requirements, which obsoletes data operation like keyword-based essay retrieval. In this paper,we present a secure multi-keyword ranked search scheme over encrypted cloud data, which simultaneously supportsdynamic up-date operations like deletion and insertion of documents. Specifically, the vector space model and thewidely-used TFIDF model are combined in the index construction and query generation. We construct a special treebased index structure and propose a Greedy Depth-first Search algorithm to provide efficient multi-keyword rankedsearch. The locked KNN algorithm is utilized to encrypt the index and query vectors, and meanwhile ensure perfectimportance score calculation between encrypted index and query vectors. In order to resist statistical attacks, phantomterms are extra to the index vector for blind search results. Due to the use of our special tree-based index structure, theproposed scheme can achieve sub-linear search time and deal with the deletion and insertion of documents flexibly.Extensive experiments are conducted to demonstrate the efficiency of the proposed scheme.

Mr. Santosh Yadavrao Divekar, Prof.Rajesh N. Phursule, “Multiple-Keyword Ranking Search Over encrypted Data with Secure and Dynamic Operation.”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 6, pp. 514-518, June 2017.