Cryptology ePrint Archive: Report 2015/923


Sikhar Patranabis and Yash Shrivastava and Debdeep Mukhopadhyay

Abstract: The recent advent of cloud computing and the IoT has made it imperative to have efficient and secure cryptographic schemes for online 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 constant 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 computable bilinear pairings for encryption and decryption operations. Each scheme is formally proven to be semantically secure. Practical experiments have been conducted to validate all claims made in the paper.

Category / Keywords: public-key cryptography / Key-Aggregate CryptoystemOnline data sharing, Semantic security, Dynamic access rights

Original Publication (with minor differences): INDOCRYPT 2015

Date: received 22 Sep 2015

Contact author: sikharpatranabis at gmail com

Available format(s): PDF | BibTeX Citation

Note: An extended abstract of this paper has been accepted in INDOCRYPT 2015 and will appear in the proceedings.

Version: 20150922:210226 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]