Paper 2004/115
Provably-Secure and Communication-Efficient Scheme for Dynamic Group Key Exchange
Junghyun Nam, Sungduk Kim, Seungjoo Kim, and Dongho Won
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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- group key agreementauthenticated key agreementprovable securityfactoring
- Contact author(s)
- jhnam @ dosan skku ac kr
- History
- 2004-05-17: received
- Short URL
- https://ia.cr/2004/115
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2004/115,
author = {Junghyun Nam and Sungduk Kim and Seungjoo Kim and Dongho Won},
title = {Provably-Secure and Communication-Efficient Scheme for Dynamic Group Key Exchange},
howpublished = {Cryptology ePrint Archive, Paper 2004/115},
year = {2004},
note = {\url{https://eprint.iacr.org/2004/115}},
url = {https://eprint.iacr.org/2004/115}
}
