Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

Junghyun Nam, Sungduk Kim, Seungjoo Kim, Dongho Won

Published Jan 1, 2004• 3 citations
OpenAlex

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.

Related papers

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

Junghyun Nam, Jinwoo Lee, Sungduk Kim +2 more

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 my of group rekeying operations, while achieving optimal message complexity.

Information Security and Cryptology•Jan 1, 2004•7 citations

1-round dynamic group key agreement

YE Cheng-qing

Among the conventional round group key agreement protocol,the minimal number of message exchange round is 2.The efficiency of the protocol is affected by the number of message exchange round.Using a secret shared technology that two parties share a common static secret without any interaction between them,an efficient one-round ID-based authenticated group key agreement scheme was proposed and extended to the dynamic group.The number of message exchanged during the key agreement in this one-round protocol is reduced to half of that in two-round protocols.So the efficiency of its communication is improved.The proposed scheme was proved to be secure and be forward and backward secure,and can be applied to the secure group communication where the perfect forward secure is not needed.

Journal of Zhejiang University(Engineering Science)•Jan 1, 2007•0 citations

Forward secure identity-based key agreement for dynamic groups

Nick Mailloux, Ali Miri, Monica Nevins

We propose a new identity-based authenticated group key agreement protocol that provides both perfect forward secrecy and key integrity, while offering low communication and computational complexity. We prove the security of our protocol under the decisional bilinear Diffie-Hellman assumption in the random oracle model. In addition, we propose efficient auxiliary key agreement protocols that maintain perfect forward secrecy, while allowing members to discard their ephemeral keys in the same session in which they were created.

Conference on Privacy, Security and Trust•Jul 1, 2011•1 citation

Round-optimal ID-based dynamic authenticated group key agreement

Fei Li, Dongqing Xie, Wei Gao +2 more

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.

International Journal of High Performance Systems Architecture•Jan 1, 2016•0 citations

An Efficient Group Key Agreement Protocol from Bilinear Pairings

Chengyu Hu, Pengtao Liu, LI Daxing

A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.

Computational Intelligence and Security•Dec 15, 2007•2 citations

An Efficient Group Key Agreement Protocol from Bilinear Pairings

Chengyu Hu, Pengtao Liu, Daxing Li

A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.

International Conference on Computational Intelligence and Security Workshops (CISW)•Dec 1, 2007•1 citation
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.
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 my of group rekeying operations, while achieving optimal message complexity.
Among the conventional round group key agreement protocol,the minimal number of message exchange round is 2.The efficiency of the protocol is affected by the number of message exchange round.Using a secret shared technology that two parties share a common static secret without any interaction between them,an efficient one-round ID-based authenticated group key agreement scheme was proposed and extended to the dynamic group.The number of message exchanged during the key agreement in this one-round protocol is reduced to half of that in two-round protocols.So the efficiency of its communication is improved.The proposed scheme was proved to be secure and be forward and backward secure,and can be applied to the secure group communication where the perfect forward secure is not needed.
We propose a new identity-based authenticated group key agreement protocol that provides both perfect forward secrecy and key integrity, while offering low communication and computational complexity. We prove the security of our protocol under the decisional bilinear Diffie-Hellman assumption in the random oracle model. In addition, we propose efficient auxiliary key agreement protocols that maintain perfect forward secrecy, while allowing members to discard their ephemeral keys in the same session in which they were created.
A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.
A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.
A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.