Burmester-Desmedt Tree-Based Key Transport Revisited: Provable Security

Jens Matthias-Bohli; Maria Isabel Gonzalez Vasco; Rainer Steinwandt

Paper 2005/360

Burmester-Desmedt Tree-Based Key Transport Revisited: Provable Security

Jens Matthias-Bohli, Maria Isabel Gonzalez Vasco, and Rainer Steinwandt

Abstract

A tree-based key transport protocol is presented which can be seen as a generalizing variant of the star- and tree-based protocols proposed by Burmester and Desmedt at EUROCRYPT '94. Our scheme does not rely on the availability of globally verifiable signatures or arbitrary point-to-point connections, and its security against active adversaries is proven in the standard model under the Decision Diffie Hellman assumption.

Metadata

Available format(s): PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: Group Key Stablishment Provable Security
Contact author(s): mariaisabel vasco @ urjc es
History: 2005-10-11: last of 2 revisions; 2005-10-09: received; See all versions
Short URL: https://ia.cr/2005/360
License: CC BY

BibTeX

@misc{cryptoeprint:2005/360,
      author = {Jens Matthias-Bohli and Maria Isabel Gonzalez Vasco and Rainer Steinwandt},
      title = {Burmester-Desmedt Tree-Based Key Transport Revisited: Provable Security},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/360},
      year = {2005},
      url = {https://eprint.iacr.org/2005/360}
}