Paper 2005/366

Efficient Compilers for Authenticated Group Key Exchange

Qiang Tang and Chris J. Mitchell

Abstract

In this paper we propose two compilers which are designed to transform a group key exchange protocol secure against any passive adversary into an authenticated group key exchange protocol with key confirmation which is secure against any passive adversary, active adversary, or malicious insider. We show that the first proposed compiler gives protocols that are more efficient than those produced by the compiler of Katz and Yung. The second proposed compiler further reduces the computational complexity of the output protocols by using a Trusted Third Party (TTP). We moreover show that, although the protocols produced by the novel compilers have lower computational complexity than the protocols produced by the Katz-Yung compiler, the protocols nevertheless achieve key confirmation, unlike the protocols output by the Katz-Yung compiler.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. A simplified version of this paper will appear in the proceeding of CIS 2005
Keywords
key agreementauthentication
Contact author(s)
qiang tang @ rhul ac uk
History
2005-10-10: received
Short URL
https://ia.cr/2005/366
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/366,
      author = {Qiang Tang and Chris J.  Mitchell},
      title = {Efficient Compilers for Authenticated Group Key Exchange},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/366},
      year = {2005},
      url = {https://eprint.iacr.org/2005/366}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.