Paper 2005/131

Dynamic Group Key Agreement in Tree-Based Setting

Ratna Dutta and Rana Barua

Abstract

We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We prove that our protocol is provably secure in the standard security model of Bresson et al. An appropriate modification of Katz-Yung approach to tree based setting is adopted while proving its security against active adversaries. The protocol has an in-built hierarchical structure that makes it desirable for certain applications.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Accepted in ACISP 2005, to appear
Keywords
bilinear pairingmulti-signaturegroup key agreementdynamic operationsprovable security
Contact author(s)
ratna_r @ isical ac in
History
2005-05-05: revised
2005-05-05: received
See all versions
Short URL
https://ia.cr/2005/131
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/131,
      author = {Ratna Dutta and Rana Barua},
      title = {Dynamic Group Key Agreement in Tree-Based Setting},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/131},
      year = {2005},
      url = {https://eprint.iacr.org/2005/131}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.