Providing security for the Encrypted shared data in the cloud Environment

Abstract

In the gift system a secure multi-keyword class-conscious search theme over encrypted cloud data, that at a similar time supports dynamic update operations like deletion and insertion of documents. Specifically, the vector house model and conjointly the widely-used TF_IDF model unit combined among the index construction and question generation. we tend to tend to construct a special tree-based index structure and propose a “Greedy Depth-first Search” rule to provide economical multi-keyword class-conscious search. The secure kNN rule is employed to inscribe the index and question vectors, and within the meanwhile guarantee correct association score calculation between encrypted index and question vectors. Therefore on resist math attacks, phantom terms unit supplementary to the index vector for bright search results. Attributable to the utilization of our special tree-based index structure, the planned theme will do sub-linear search time and upset the deletion and insertion of documents flexibly. Intensive experiments unit conducted to demonstrate the efficiency of the planned theme. Among the planned system we tend to tend to propose the first privacy-preserving mechanism that allows public auditing on shared data keep among the cloud. Specially, we tend to tend to take advantage of ring signatures to calculate the verification knowledge needed to audit the integrity of shared data. With our mechanism, the identity of the signer on each block in shared data is unbroken personal from a third-party auditor (TPA), United Nations agency continues to be able to publically verify the integrity of shared data whereas not retrieving the full file. Our experimental results demonstrate the effectiveness and efficiency of our planned mechanism once auditing shared data.