• Aashukumar Kandu
• Ashish Pandey
• Raghavendra Jha
• Shivam Mishra
• Prof. Saurabh Suman

The Key-Aggregate Searchable Encryption (KASE) is a public key encryption scheme which is adapted from key-aggregate cryptosystem scheme and multi-key searchable encryption scheme. KASE is a type of tree structure which will explain the type of cipher-text which can be decrypted by using the key. Key-aggregate searchable encryption is a framework scheme which is described as where a data owner only needs to generate and distribute a single aggregate key to a data user for sharing a large number of documents and on the other side only needs to submit a single aggregate trapdoor to the cloud server, so that he/she can query over the shared documents by the help of generated single aggregate trapdoor. KAS Encryption framework scheme is perfectly more secure, flexible and practically efficient. In this group of selected documents need to be shared with any group of different user’s desire by right different encryption keys to be used for different documents. However need of producing complex number of keys for both process i.e. encryption and search, and distributing to different users and those users will have to safely store the keys and put forward complex number of keywords trapdoors to the clouds in order to search for data.

Searchable encryption, data sharing, aggregate key, data owner, trapdoor. Cloud Storage, Data Privacy, Cryptosystem, Authentication.

"KEY-AGGREGATE SEARCHABLE ENCRYPTION FOR GROUP DATA SHARING VIA CLOUD COMPUTING ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 3, page no.394-398, March-2019, Available :http://www.jetir.org/papers/JETIR1903B63.pdf

"KEY-AGGREGATE SEARCHABLE ENCRYPTION FOR GROUP DATA SHARING VIA CLOUD COMPUTING ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 3, page no. pp394-398, March-2019, Available at : http://www.jetir.org/papers/JETIR1903B63.pdf