CryptoDB
Dynamic Group Key Agreement in Tree-Based Setting
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12467, title={Dynamic Group Key Agreement in Tree-Based Setting}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / bilinear pairing, multi-signature, group key agreement, dynamic operations, provable security}, url={http://eprint.iacr.org/2005/131}, note={Accepted in ACISP 2005, to appear ratna_r@isical.ac.in 12908 received 3 May 2005, last revised 5 May 2005}, author={Ratna Dutta and Rana Barua}, year=2005 }