• Dishika Ravindra
• Keerthi G Naidu
• L Vinith Kumar
• Lavanya M
• Dr. Dayananda R B

Searchable encryption enables a cloud server to lead keyword search over scrambled information for the benefit of the clients without learning the basic plaintexts. Notwithstanding, most existing accessible encryption plots just help single or conjunctive keyword look, while a couple of different plans that can perform expressive keyword search that are computationally wasteful since they are worked from bilinear pairings over the composite-request gatherings. In this paper, we propose an expressive public key accessible encryption conspire in the prime-request gatherings, which permits keyword look arrangements (i.e., predicates, get to structures) to be communicated in conjunctive, disjunctive or any monotonic Boolean equations and accomplishes noteworthy execution improvement over existing plans. We formally characterize its security, and demonstrate that it is specifically secure in the standard model.

Searchable encryption, cloud computing, expressiveness, attribute based encryption.

"Expressive keyword search in cloud over encrypted data", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.397-402, May-2019, Available :http://www.jetir.org/papers/JETIR1905560.pdf

"Expressive keyword search in cloud over encrypted data", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp397-402, May-2019, Available at : http://www.jetir.org/papers/JETIR1905560.pdf