Efficient and Expressive Keyword Search Over Encrypted Data in Cloud

Efficient and Expressive Keyword Search Over Encrypted Data in Cloud
Author(s):
TATIMAKULA RAJASEKHAR
Keywords:
Cloud Computing
Abstract
In this project 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 and conduct several experiments to eva ent than the ones built over the composite-order groups . Keyword research is one luate it performance
Article Details
Unique Paper ID: 145731 Publication Volume & Issue: Volume 4, Issue 11 Page(s): 202 - 209
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org