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

International Conference on Availability, Reliability and Security (ARES)

New Efficient and Authenticated Key Agreement Protocol in Dynamic Peer Group

Shengke Zeng, Mingxing He, Weidong Luo

Published Mar 1, 2008• 0 citations
Publisher

Abstract

The members in the dynamic peer group (DPG) are divided into several clusters according to linker cluster architecture (J.B. Dennis and E. Anthony, 1981). In each cluster, the members perform the BD protocol (M. Burmester and Y. Desmedt, 1994) to establish the cluster key and the TGDH protocol (Y. Kim et al., 2004) is performed among the clusters to generate the group key. This method can not only avoid the weakness of AKA (auxiliary key agreement) of BD, but also reduce the computation cost of TGDH scheme. In our scheme the members have been authenticated based identity, and we prove the security in random oracle model.

DOI
10.1109/ares.2008.60

Related papers

Efficient ID-Based Two Round Authenticated Group Key Agreement Protocol

Hong Jun Tang, Liehuang Zhu, Zijian Zhang

Group key agreement protocol allows all the members to agree upon a common session key, which may be used for later secure communication among all the participants. Through incorporating ID-based authenticated two-party key agreement protocol proposed by McCullagh et al. and constant round group key agreement proposed by Burmester and Desmedt, we propose a new ID-based two round authenticated group key agreement protocol which is more efficient than previously proposed protocols in terms of both communication and computation cost.

International Conference on Wireless Communications, Networking and Mobile Computing•Oct 1, 2008•5 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

ID-Based Authenticated Key Agreement Protocol in Dynamic Peer Groups

Xiao Guo-zhen

The two round dynamic group key agreement protocol(DB08 protocol) proposed by Dutta and Barua doesn't provide key independence.To improve DB08 protocol,an ID-based authenticated key agreement protocol in dynamic peer groups is presented by using Sakai R and Kasahara M's key construction.To avoid the correlation of the sub-keys for different sessions,hash functions and session identifiers are included while computing the sub-keys in the new protocol.So the new protocol achieves key independence,and it provides perfect forward secrecy,KGC-forward secrecy and resistance to passive and active attacks as well.Compared with DB08 protocol,the computation and communication costs are greatly reduced in the new protocol.So the new protocol is more efficient and applicable for dynamic peer network.

Journal of Wuhan University•Jan 1, 2008•0 citations

Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting

Ratna Dutta, Rana Barua

In this paper, we present and analyze a variant of Burmester-Desmedt group key agreement protocol (BD) and enhance it to dynamic setting where a set of users can leave or join the group at any time during protocol execution with updated keys. In contrast to BD protocol, let us refer to our protocol as DB protocol. Although the DB protocol is similar to BD protocol, there are subtle differences between them: 1) Key computation in DB protocol is different and simpler than in BD protocol with same complexity of BD protocol; 2) Number of rounds required in our authenticated DB protocol is one less than that in authenticated BD protocol introduced by Katz-Yung; 3) DB protocol is more flexible than BD protocol in the sense that DB protocol is dynamic. The reusability of user's precomputed data in previous session enables the join and leave algorithms of our DB protocol to reduce most user's computation complexities which can be useful in real life applications; and 4) DB protocol has the ability to detect the presence of corrupted group members, although one can not detect who among the group members are behaving improperly.

IEEE Transactions on Information Theory•Apr 28, 2008•104 citations

A Complete Anonymous Group Key Agreement Protocol

Gang Yao, Dengguo Feng

Identity-based key agreement protocols allow the participants in a group exchange information over an open network with each other. However, in most of proposed IDbased protocol, identities of group users are exposed, so that eavesdroppers can easily learn who belongs to the specific group. In this paper, we proposed a complete anonymous group key agreement protocol based on the Burmester and Desmedt mechanism and ID-based encryption cryptosystems. The proposed protocol is provably-secure in the random oracle model, and achieves the following security attribute: complete anonymity, unlinkability, group key secrecy, perfect forward secrecy for the group session key and entity authentication.

International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC)•Jan 1, 2010•7 citations

An escrow-less identity-based group-key agreement protocol for dynamic peer groups

Saikat Chakrabarti, Santosh Chandrasekhar, Mukesh Singhal

Dynamic Peer Group (DPG) applications, such as video-conferencing and multi-user gaming environments have proliferated the internet and group-key agreement protocols are critical in securing DPG communication. Identity-based cryptosystems avoid certificate management complications inherent to traditional public-key systems but introduce key escrow, which is highly undesirable in most applications. We design a scalable technique to eliminate key escrow and develop a distributed, escrow-less identity-based group-key agreement protocol for securing resource-constrained DPG communication. The proposed protocol is provably secure against passive adversaries, resilient to active attacks, scalable and more cost effective than any such protocol. We provide a detailed theoretical analysis to support the claims.

International Journal of Security and Networks•Jan 1, 2009•12 citations
The members in the dynamic peer group (DPG) are divided into several clusters according to linker cluster architecture (J.B. Dennis and E. Anthony, 1981). In each cluster, the members perform the BD protocol (M. Burmester and Y. Desmedt, 1994) to establish the cluster key and the TGDH protocol (Y. Kim et al., 2004) is performed among the clusters to generate the group key. This method can not only avoid the weakness of AKA (auxiliary key agreement) of BD, but also reduce the computation cost of TGDH scheme. In our scheme the members have been authenticated based identity, and we prove the security in random oracle model.
Group key agreement protocol allows all the members to agree upon a common session key, which may be used for later secure communication among all the participants. Through incorporating ID-based authenticated two-party key agreement protocol proposed by McCullagh et al. and constant round group key agreement proposed by Burmester and Desmedt, we propose a new ID-based two round authenticated group key agreement protocol which is more efficient than previously proposed protocols in terms of both communication and computation cost.
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.
The two round dynamic group key agreement protocol(DB08 protocol) proposed by Dutta and Barua doesn't provide key independence.To improve DB08 protocol,an ID-based authenticated key agreement protocol in dynamic peer groups is presented by using Sakai R and Kasahara M's key construction.To avoid the correlation of the sub-keys for different sessions,hash functions and session identifiers are included while computing the sub-keys in the new protocol.So the new protocol achieves key independence,and it provides perfect forward secrecy,KGC-forward secrecy and resistance to passive and active attacks as well.Compared with DB08 protocol,the computation and communication costs are greatly reduced in the new protocol.So the new protocol is more efficient and applicable for dynamic peer network.
In this paper, we present and analyze a variant of Burmester-Desmedt group key agreement protocol (BD) and enhance it to dynamic setting where a set of users can leave or join the group at any time during protocol execution with updated keys. In contrast to BD protocol, let us refer to our protocol as DB protocol. Although the DB protocol is similar to BD protocol, there are subtle differences between them: 1) Key computation in DB protocol is different and simpler than in BD protocol with same complexity of BD protocol; 2) Number of rounds required in our authenticated DB protocol is one less than that in authenticated BD protocol introduced by Katz-Yung; 3) DB protocol is more flexible than BD protocol in the sense that DB protocol is dynamic. The reusability of user's precomputed data in previous session enables the join and leave algorithms of our DB protocol to reduce most user's computation complexities which can be useful in real life applications; and 4) DB protocol has the ability to detect the presence of corrupted group members, although one can not detect who among the group members are behaving improperly.
Identity-based key agreement protocols allow the participants in a group exchange information over an open network with each other. However, in most of proposed IDbased protocol, identities of group users are exposed, so that eavesdroppers can easily learn who belongs to the specific group. In this paper, we proposed a complete anonymous group key agreement protocol based on the Burmester and Desmedt mechanism and ID-based encryption cryptosystems. The proposed protocol is provably-secure in the random oracle model, and achieves the following security attribute: complete anonymity, unlinkability, group key secrecy, perfect forward secrecy for the group session key and entity authentication.
Dynamic Peer Group (DPG) applications, such as video-conferencing and multi-user gaming environments have proliferated the internet and group-key agreement protocols are critical in securing DPG communication. Identity-based cryptosystems avoid certificate management complications inherent to traditional public-key systems but introduce key escrow, which is highly undesirable in most applications. We design a scalable technique to eliminate key escrow and develop a distributed, escrow-less identity-based group-key agreement protocol for securing resource-constrained DPG communication. The proposed protocol is provably secure against passive adversaries, resilient to active attacks, scalable and more cost effective than any such protocol. We provide a detailed theoretical analysis to support the claims.