This paper is published in Volume 3, Issue 2, 2018
Area
Cloud Computing
Author
Ansh Gupta
Co-authors
Akshada Navale, Diksha Pardeshi, Pooja Vaidkar, Prof. Minal Chalakh
Org/Univ
MIT College of Engineering, Pune, Maharashtra, India
Pub. Date
21 February, 2018
Paper ID
V3I2-1185
Publisher
Keywords
Cloud Computing, Keyword Search, Encryption, Diffie-Hellman Algorithm

Citationsacebook

IEEE
Ansh Gupta, Akshada Navale, Diksha Pardeshi, Pooja Vaidkar, Prof. Minal Chalakh. Cloud Based File Sharing and User Revocation System Using Key Aggregate Searchable Encryption, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARnD.com.

APA
Ansh Gupta, Akshada Navale, Diksha Pardeshi, Pooja Vaidkar, Prof. Minal Chalakh (2018). Cloud Based File Sharing and User Revocation System Using Key Aggregate Searchable Encryption. International Journal of Advance Research, Ideas and Innovations in Technology, 3(2) www.IJARnD.com.

MLA
Ansh Gupta, Akshada Navale, Diksha Pardeshi, Pooja Vaidkar, Prof. Minal Chalakh. "Cloud Based File Sharing and User Revocation System Using Key Aggregate Searchable Encryption." International Journal of Advance Research, Ideas and Innovations in Technology 3.2 (2018). www.IJARnD.com.

Abstract

The potential of by selection sharing encrypted knowledge with totally different users via public cloud storage might greatly ease security issues over unintended knowledge leaks within the cloud. A key challenge to coming up with such coding schemes lies within the economical management of coding keys. the specified flexibility of sharing any cluster of chosen documents with any cluster of users demands totally different coding keys to be used for various documents. However, this additionally implies the requirement of firmly distributing to users an outsized variety of keys for each coding and search, and people users can got to firmly store the received keys, associate degreed submit an equally sizable amount of keyword trapdoors to the cloud so as to perform search over the shared data. The tacit want for secure communication, storage, and complexness clearly renders the approach impractical. during this paper, we have a tendency to address this sensible downside, that is essentially neglected within the literature, by proposing the novel conception of key combination searchable coding (KASE) and instantiating the conception through a concrete KASE theme, during which an information owner solely must distribute one key to a user for sharing an outsized variety of documents, and therefore the user solely must submit one trapdoor to the cloud for querying the shared documents. the protection analysis and performance analysis each ensure that our planned schemes square measure incontrovertibly secure and much economical.
Paper PDF