EFFICIENT AND EXPRESSIVE KEYWORD SEARCH OVER ENCRYPTED DATA IN CLOUD

Abstract

For information customers, searchable encryption means that a cloud server can do keyword searches
over encrypted data without obtaining the core plain texts. However, the vast majority of publicly
available encryption schemes only allow for a single or conjunctive keyword search, while the few
schemes that allow for an expressive keyword search are computationally inefficient. For the purposes
of communicating policy strategies using conjunctive, disjunctive, or monotonic Boolean equations, we
present an expressive open key accessible encryption conspire in prime-arrange gatherings in this paper.
In the standard model, we demonstrate that it is explicitly secure and present it in a formal way. We also
use Charm, a rapid prototyping tool, to put the recommended strategy into action and run a few tests to
see how well it works. It's clear from the results that our plan is more effective than the ones that were
used for composite-order groups.