Efficient and expressive keyword search over scrambled data in cloud

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The term seek encryption permits directing watchword look over encoded information in the interest of the information clients without taking in the fundamental plaintexts in cloud condition. The most existing accessible encryption code word searches just help single or conjunctive watchword look, while a couple of different plans that can perform expressive catchphrase seek are computationally wasteful since they are worked from bilinear pairings over the composite-arrange gatherings. In this paper, the code word examination demonstrates the general data entries are done in a way that accessible encryption methodologies like the prime-arrange gatherings which permits watchword seek approaches predicates, get to structures to be communicated in conjunctive, disjunctive or any monotonic Boolean equations and accomplishes critical execution change over existing plans. A standout amongst the most imperative is Keyword exploring, based on which the exceptional yield exercises in the inquiry promoting field catchphrases can represent the deciding moment of required data from cloud site.

Cite

CITATION STYLE

APA

Satya Vara Prasdad, B. B. V., Abhishekh, V., Rahul Raja, P., & Aditya, A. (2018). Efficient and expressive keyword search over scrambled data in cloud. International Journal of Engineering and Technology(UAE), 7, 976–979. https://doi.org/10.14419/ijet.v7i2.7.11440

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free