PRIVACY PRESERVING SEARCH OVER ENCRYPTED DATA ON CLOUD
| Author(s) | : | Rajendra Hiray, Kedar Jangam, Ajinkya Ingle, Ravina Dhage, Prof. R.T.Umbare |
| Institution | : | JSPM Rajarshi Shahu College of Engineering Tathawade, Pune |
| Published In | : | Vol. 5, Issue 5 — May 2018 |
| Page No. | : | 746-751 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Cloud computing provides individuals and enterprises Brobdingnagian computing power and scalable storagecapacities to support a variety of big information applications in domains like health care and scientific analysis, thereforeextra and extra information owners unit involved to to supply their information on cloud servers for wonderful conveniencein information management and mining. However, information sets like health records in electronic documents usuallycontain sensitive information, that brings relating to privacy issues if the documents unit free shared to partly untrustedthird-parties in cloud. a wise and wide used technique for information privacy preservation is to inscribe information beforeoutsourcing to the cloud servers, that however reduces information utility and makes several ancient information analyticoperators like keyword-based top-k document retrieval obsolete. throughout this paper, we tend to tend to analyze the multikeyword top-k search downside for enormous cryptography against privacy breaches, associated decide to verify Associatein Nursing efficient and secure answer to the present disadvantage. Specifically, for the privacy concern of questioninformation, we tend to tend to construct a special tree-based index structure and magnificence a random traversal formula,that makes even the same question to produce whole completely different visiting ways that on the index, and may alsomaintain the accuracy of queries unchanged beneath stronger privacy. For up the question efficiency, we tend to tend to tendto propose a gaggle multi-keyword top-k search theme supported set up of partition where a gaggle of tree-based indexesunit created for all documents. Finally, we tend to tend to combine these ways that on into Associate in Nursing efficient andsecure approach to handle our projected top-k similarity search. thorough experimental results on real-life information setsdemonstrate that our projected approach can significantly improve the potential of defensive the privacy breaches, thequality and also the time efficiency of question method over the progressive ways that.
Rajendra Hiray, Kedar Jangam, Ajinkya Ingle, Ravina Dhage, Prof. R.T.Umbare, “PRIVACY PRESERVING SEARCH OVER ENCRYPTED DATA ON CLOUD”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 5, Issue 5, pp. 746-751, May 2018.








