CryptoDB
Provably Secure Authenticated Tree Based Group Key Agreement Protocol
Authors: | |
---|---|
Download: | |
Abstract: | We present a provably secure authenticated tree based key agreement protocol. The protocol is obtained by combining Boldyreva's multi-signature with an unauthenticated ternary tree based multi-party extension of Joux's key agreement protocol. The securiry is in the standard model as formalized by Bresson et al. The proof is based on the techniques used by Katz and Yung in proving the security of their key agreement protocol. |
BibTeX
@misc{eprint-2004-12063, title={Provably Secure Authenticated Tree Based Group Key Agreement Protocol}, booktitle={IACR Eprint archive}, keywords={group key agreement, authenticated key agreement, bilinear pairing, provable security}, url={http://eprint.iacr.org/2004/090}, note={ ratna_r@isical.ac.in 12604 received 13 Apr 2004, last revised 5 Jul 2004}, author={Ratna Dutta and Rana Barua and and Palash Sarkar}, year=2004 }