Secure & Fast Keyword Search on Encrypted Cloud Data 🔒

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


MICANS INFOTECH PVT LTD, CHENNAI ,PONDICHERRY
http://www.micansinfotech.com http://www.finalyearprojectsonline.com http://www.softwareprojectscode.com
+91 90036 28940 ; +91 94435 11725 ; micansinfotech@gmail.com

Download projects@ http://www.micansinfotech.com/VIDEOS.html

ABSTRACT:
Searchable encryption allows a cloud server to conduct keyword search over encrypted data on behalf of the data users
without learning the underlying plaintexts. However, most existing searchable encryption schemes only support single or conjunctive
keyword search, while a few other schemes that are able to perform expressive keyword search are computationally inefficient since
they are built from bilinear pairings over the composite-order groups. In this paper, we propose an expressive public-key searchable
encryption scheme in 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 significant performance improvement over
existing schemes. We formally define its security, and prove that it is selectively secure in the standard model. Also, we implement the
proposed scheme using a rapid prototyping tool called Charm [37], and conduct several experiments to evaluate it performance. The
results demonstrate that our scheme is much more efficient than the ones built over the composite-order groups.