Dynamic Key-Aggregate Cryptosystem on Elliptic Curves for Online Data Sharing.
Sikhar Patranabis, Yash Shrivastava, Debdeep Mukhopadhyay · 2015
Abstract. The recent advent of cloud computing and the IoT has made it imperative to have efficient and secure cryptographic schemes for on-line data sharing. Data owners would ideally want to store their data/files online in an encrypted manner, and delegate decryption rights for some of these to users with appropriate credentials. An efficient and recently proposed solution in this regard is to use the concept of aggregation that allows users to decrypt multiple classes of data using a single key of con-stant size. In this paper, we propose a secure and dynamic key aggregate encryption scheme for online data sharing that operates on elliptic curve subgroups while allowing dynamic revocation of user access rights. We augment this basic construction to a generalized two-level hierarchical structure that achieves optimal space and time complexities, and also efficiently accommodates extension of data classes. Finally, we propose an extension to the generalized scheme that allows use of efficiently com-putable bilinear pairings for encryption and decryption operations. Each scheme is formally proven to be semantically secure. Practical experi-ments have been conducted to validate all claims made in the paper.