Cloud computing, a critical pattern for advanced data service, has became a necessary feasibility for data users to outsource data. Controversies on privacy, It is incessantly presented as outsourcing of sensitive information including emails, health history and personal photos is explosively expanding. Traditional SSE schemes enable users to securely retrieve the cipher text, but these schemes support only boolean keyword search Reports of data loss and privacy breaches in cloud computing systems appear from time to time. The cloud service providers are able to control and monitor the data and the communication between users and the cloud. A model extensively used in SSE and characterized the cloud server will honestly follow the designed protocol but is curious to analyze the hosted data and the received queries to learn extra information. SSE schemes employ server-side ranking based on order-preserving encryption to improve the efficiency of retrieval over encrypted cloud data. Server-side ranking based on order-preserving encryption violates the privacy of sensitive information. The scheme as two round searchable encryption (TRSE) scheme. Cloud, data privacy, ranking, similarity relevance, homomorphic encryption, vector space model is a terms of Multi keyword. 1) We propose the concepts of similarity relevance and scheme robustness. The server side ranking based on order-preserving encryption (OPE) inevitably violates data privacy. A two-round searchable encryption (TRSE) scheme, which fulfills the secure multi-keyword top-k retrieval over encrypted cloud data. Specifically, for the first time we employ relevance score to support multi-keyword top-k retrieval.
You are here: Home / bulk ieee projects 2013 / Similarity relevance scheme for protecting data in cloud computing