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

Security properties of two authenticated conference key agreement protocols

Qiang Tang

Published Jan 1, 2005• 0 citations
OpenAlex

Abstract

Abstract. In this paper we analyse the security of two authenticated group key agreement schemes based on the group key agreement protocol of Burmester and Desmedt. One scheme was proposed by Burmester and Desmedt, and uses a separate authentication scheme to achieve authentication among the participants. We show that this scheme suffers from a number of security vulnerabilities. The other scheme was generated using the general protocol compiler of Katz and Yung. We show that in some circumstances, even if key confirmation is implemented, this scheme still suffers from insider attacks (which are not covered by the security model used by Katz and Yung). 1

Related papers

Rethinking the security of some authenticated group key agreement schemes.

Qiang Tang, Chris J. Mitchell

In this paper we analyse three improved authenticated group key agreement schemes, all of which are based on the conference key distribution systems proposed by Burmester and Desmedt. We show that all the schemes suffer from a type of impersonation attack, although these schemes are claimed to be secure.

•Jan 1, 2004•6 citations

An Insider Attack Resistant Group Key Agreement Protocol from Pairings

Yongzhong He, Xiaoyong Li, Zhen Han

Authenticated group key agreement allows a group of users to generate a shared key which satisfies various security requirements. Several identity-based authenticated group key agreement schemes are proposed. However, these schemes are shown to be vulnerable to insider impersonation attacks that any two malicious group members can impersonate other user to agree some session keys in a new group. In this paper, a simple two round authenticated group agreement scheme based on Burmester and Desmedt's scheme is proposed. Compared to previous protocols, our protocol is efficient while secure against various known attacks, including key exposure attacks and insider impersonation attacks.

International Conference on Innovative Computing, Information and Control•Sep 1, 2007•4 citations

Enhancement of an Authenticated 3-round Identity-Based Group Key Agreement Protocol

Wei Yuan, Liang Qing Hu, Hongtu Li +2 more

In 2008, Gang Yao et al. proposed an authenticated 3-round identity-based group key agreement protocol, which is based on Burmester and Desmedt’s protocol proposed at Eurocrypt 94. However, their protocol can only prevent passive attack. If the active attack is allowed, the protocol is vulnerable and an internal attacker can forge her neighbor’s keying material. It is obvious that the protocol do not achieve the aim of authentication. In this paper, we discuss the flaws to attack this protocol and propose an enhanced provably-secure protocol based on their protocol. At last, we make a detailed security analysis of our enhanced authenticated identity-based group key agreement protocol.

Journal of Networks•Oct 19, 2011•0 citations

An Authenticated 3-Round Identity-Based Group Key Agreement Protocol

Gang Yao, Hongji Wang, Qingshan Jiang

Key agreement protocols allow two or more participants exchange information over an open network with each other. In modern collaborative and distributed applications, authenticated group key agreement is one of the important issues. Recently identity-based authenticated key agreement protocol has been increasingly investigated because of the simplicity of a public key management. In this paper, we propose an authenticated three-round identity-based group key agreement protocol. The first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation. The proposed protocol is based on the protocol of Burmester and Desmedt, and the protocol is provably- secure in the random oracle model. In particular, the proposed authenticated identity-based group key agreement protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously.

International Conference on Availability, Reliability and Security (ARES)•Mar 1, 2008•12 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

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
Abstract. In this paper we analyse the security of two authenticated group key agreement schemes based on the group key agreement protocol of Burmester and Desmedt. One scheme was proposed by Burmester and Desmedt, and uses a separate authentication scheme to achieve authentication among the participants. We show that this scheme suffers from a number of security vulnerabilities. The other scheme was generated using the general protocol compiler of Katz and Yung. We show that in some circumstances, even if key confirmation is implemented, this scheme still suffers from insider attacks (which are not covered by the security model used by Katz and Yung). 1
Authenticated group key agreement allows a group of users to generate a shared key which satisfies various security requirements. Several identity-based authenticated group key agreement schemes are proposed. However, these schemes are shown to be vulnerable to insider impersonation attacks that any two malicious group members can impersonate other user to agree some session keys in a new group. In this paper, a simple two round authenticated group agreement scheme based on Burmester and Desmedt's scheme is proposed. Compared to previous protocols, our protocol is efficient while secure against various known attacks, including key exposure attacks and insider impersonation attacks.
In 2008, Gang Yao et al. proposed an authenticated 3-round identity-based group key agreement protocol, which is based on Burmester and Desmedt’s protocol proposed at Eurocrypt 94. However, their protocol can only prevent passive attack. If the active attack is allowed, the protocol is vulnerable and an internal attacker can forge her neighbor’s keying material. It is obvious that the protocol do not achieve the aim of authentication. In this paper, we discuss the flaws to attack this protocol and propose an enhanced provably-secure protocol based on their protocol. At last, we make a detailed security analysis of our enhanced authenticated identity-based group key agreement protocol.
Key agreement protocols allow two or more participants exchange information over an open network with each other. In modern collaborative and distributed applications, authenticated group key agreement is one of the important issues. Recently identity-based authenticated key agreement protocol has been increasingly investigated because of the simplicity of a public key management. In this paper, we propose an authenticated three-round identity-based group key agreement protocol. The first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation. The proposed protocol is based on the protocol of Burmester and Desmedt, and the protocol is provably- secure in the random oracle model. In particular, the proposed authenticated identity-based group key agreement protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously.
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.
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.