[Resource Topic] 2004/115: Provably-Secure and Communication-Efficient Scheme for Dynamic Group Key Exchange

Welcome to the resource topic for 2004/115

Provably-Secure and Communication-Efficient Scheme for Dynamic Group Key Exchange

Authors: Junghyun Nam, Sungduk Kim, Seungjoo Kim, Dongho Won


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

ePrint: https://eprint.iacr.org/2004/115

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .