CryptoDB
Provably-Secure and Communication-Efficient Scheme for Dynamic Group Key Exchange
| Authors: | |
|---|---|
| Download: | |
| Abstract: | Group key agreement protocols are designed to solve the fundamental problem of securely establishing a session key among a group of parties communicating over a public channel. Although a number of protocols have been proposed to solve this problem over the years, they are not well suited for a high-delay wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of exchanged messages, both of which are recognized as the dominant factors that slow down group key agreement over a networking environment with high communication latency. In this paper we present a communication-efficient group key agreement protocol and prove its security in the random oracle model under the factoring assumption. The proposed protocol provides perfect forward secrecy and requires only a constant number of communication rounds for any of group rekeying operations, while achieving optimal message complexity. |
BibTeX
@misc{eprint-2004-12087,
title={Provably-Secure and Communication-Efficient Scheme for Dynamic Group Key Exchange},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / group key agreement, authenticated key agreement, provable security, factoring},
url={http://eprint.iacr.org/2004/115},
note={ jhnam@dosan.skku.ac.kr 12555 received 17 May 2004},
author={Junghyun Nam and Sungduk Kim and Seungjoo Kim and Dongho Won},
year=2004
}