A Secure and Dynamic Keyword Ranked Search Scheme over Encrypted Cloud Data Using Abe

G. Renuka, P.R. Rajesh Kumar


Perceptive information ought to be encrypted before outsourcing for privacy wants, which obsoletes information utilization like keyword-based document retrieval. Cloud computing has become more and {more} more fashionable for information homeowners to source their information to public cloud servers whereas permitting information users to retrieve this information. For privacy issues, secure searches over encrypted cloud information have intended many analysis works underneath the one owner model. We are able to secure multi-keyword hierarchal search theme over encrypted cloud information, which at the same time supports dynamic update operations like deletion and insertion of documents. During this paper, we have a tendency to propose schemes to traumatize Privacy protective hierarchal Multi-keyword Search in an exceedingly Multi-owner model (PRMSM). To modify cloud servers to perform secure search while not knowing the particular information of each keywords and trapdoors, we have a tendency to consistently construct a unique secure search protocol. To rank the search results and preserve the privacy of relevance’s scores between keywords and files, we have a tendency to propose a unique Additive Order and Privacy protective perform family. What is more, PRMSM supports economical information user revocation. In depth experiments on real-world datasets ensure the efficaciousness and potency of PRMSM.

Full Text:


Copyright (c) 2017 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 

Paper submission: ijr@pen2print.org