An Enhanced and Reliable Over Encrypted Data in Cloud

Cherukuri Alekhya, A.Hanumath Prasad


Accessible encryption enables a cloud server to direct watchword seek over scrambled information in the interest of the information clients without taking in the fundamental plaintexts. Nonetheless, most existing accessible encryption plots just help single or conjunctive watchword seek, while a couple of different plans that can perform expressive catchphrase look are computationally wasteful since they are worked from bilinear pairings over the composite-arrange gatherings In this paper, we present a safe multi-watchword positioned look conspire over scrambled cloud information, which at the same time bolsters dynamic refresh activities like erasure and inclusion of records. In particular, the vector space display and the generally utilized TF_IDF demonstrate are consolidated in the list development and question age. We build a unique tree-based file structure and propose an "Avaricious Depth-first Search" calculation to give productive multi-catchphrase positioned seek. The safe kNN calculation is used to scramble the list and question vectors, and in the interim guarantee exact importance score count between encoded record and inquiry vectors. With the end goal to oppose measurable assaults, apparition terms are added to the list vector for blinding indexed lists. Because of the utilization of our exceptional tree-based list structure, the proposed plan can accomplish sub-direct hunt time and manage the cancellation and addition of records adaptably. Broad tests are directed to exhibit the productivity of the proposed plan.

Full Text:


Copyright (c) 2019 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 

Paper submission: