Paper 2015/923

DYNAMIC KEY-AGGREGATE CRYPTOSYSTEM ON ELLIPTIC CURVES FOR ONLINE DATA SHARING

Sikhar Patranabis, 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.

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

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Minor revision. INDOCRYPT 2015
Keywords
Semantic securityDynamic access rights
Contact author(s)
sikharpatranabis @ gmail com
History
2015-09-22: received
Short URL
https://ia.cr/2015/923
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/923,
      author = {Sikhar Patranabis and Yash Shrivastava and Debdeep Mukhopadhyay},
      title = {DYNAMIC KEY-AGGREGATE CRYPTOSYSTEM ON ELLIPTIC CURVES FOR ONLINE DATA SHARING},
      howpublished = {Cryptology ePrint Archive, Paper 2015/923},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/923}},
      url = {https://eprint.iacr.org/2015/923}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.