PROJECT TITLE :

Efficient and Expressive Keyword Search Over Encrypted Data in Cloud - 2018

ABSTRACT:

Searchable encryption allows a cloud server to conduct keyword search over encrypted information on behalf of the information users without learning the underlying plaintexts. However, most existing searchable encryption schemes solely support single or conjunctive keyword search, while a few different schemes that are able to perform expressive keyword search are computationally inefficient since they're built from bilinear pairings over the composite-order groups. During this Project, we propose an expressive public-key searchable encryption scheme within the prime-order groups, which allows keyword search policies (i.e., predicates, access structures) to be expressed in conjunctive, disjunctive or any monotonic Boolean formulas and achieves important performance improvement over existing schemes. We formally define its security, and prove that it's selectively secure in the quality model. Also, we tend to implement the proposed theme employing a fast prototyping tool referred to as Charm [37], and conduct many experiments to guage it performance. The results demonstrate that our scheme is abundant additional economical than the ones designed over the composite-order groups.