Provably Secure Authenticated Tree Based Group Key Agreement Protocol

Ratna Dutta; Rana Barua; Palash Sarkar

Paper 2004/090

Provably Secure Authenticated Tree Based Group Key Agreement Protocol

Ratna Dutta, Rana Barua, and Palash Sarkar

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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: group key agreement authenticated key agreement bilinear pairing provable security
Contact author(s): ratna_r @ isical ac in
History: 2004-07-05: last of 3 revisions; 2004-04-13: received; See all versions
Short URL: https://ia.cr/2004/090
License: CC BY

BibTeX

@misc{cryptoeprint:2004/090,
      author = {Ratna Dutta and Rana Barua and Palash Sarkar},
      title = {Provably Secure Authenticated Tree Based Group Key Agreement Protocol},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/090},
      year = {2004},
      url = {https://eprint.iacr.org/2004/090}
}