KEY AGGREGATE SEARCHABLE ENCRYPTION WITH SECURE AND EFFICIENT DATA SHARING IN CLOUD

Main Article Content

DR. Y. DASARATHA RAMI REDDY MR. G. SREENIVASA REDDY

Abstract

The proficiency of selectively allocating encrypted data with different users via public cloud storage may greatly affluence security disquiets over unintentional data leaks in the cloud. A crucial defy to scheming such encryption schemes lies in the efficient management of encryption keys. The preferred pliability of partaking any group of selected documents with any group of Users demands altered encryption keys to be used for different documents. However, this also suggests the necessity of securely distributing to users a large number of keys for both encryption and search, and those users will have to securely store the received keys, and submit an equally large number of keyword trapdoors to the cloud in order to perform search over the shared data. The practical problem, which is largely abandoned in the literature, by suggesting the novel concept of key aggregate searchable encryption (KASE) and instantiating the concept through a concrete KASE scheme, in which a data owner only needs to distribute a single key to a user for sharing a large number of documents, and the user only needs to submit a single trapdoor to the cloud for querying the shared documents. The security analysis and performance evaluation both confirm that proposed schemes are provably secure and practically efficient.

Article Details

Section
Articles