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 StablishmentProvable 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
Creative Commons Attribution
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},
      note = {\url{https://eprint.iacr.org/2005/360}},
      url = {https://eprint.iacr.org/2005/360}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.