Certificate-Free Aggregate Encryption using Elliptic Curves

Having efficient and safe cryptographic techniques for online data exchange is now more important than ever with the rise of the use of cloud computing & the Internet of Things. In a perfect world, those storing data or files online would utilize encryption and provide selected individuals the keys to access such files. with the idea of aggregation, which enables users to decode several kinds of data with an individual key of constant size, is a modern and efficient proposal in this area. For online data sharing, we offer a dynamic key aggregating encryption technique that works on elliptic curve groups and permits dynamic withdrawal of user access rights. We extend this fundamental architecture to a generic two-tiered hierarchical structure that not only effectively permits expansion of data classes but also achieves optimum space and temporal complexity. Finally, we offer an addition to the generalized method that makes it possible to perform encryption and decryption using efficiently computable bilinear pairings. Formal proofs are provided that each scheme is semantically secure. All of the paper’s assertions have been verified by actual experiments.