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 Innovative Computing, Information and Control

An Insider Attack Resistant Group Key Agreement Protocol from Pairings

Yongzhong He, Xiaoyong Li, Zhen Han

Published Sep 1, 2007• 4 citations
Publisher

Abstract

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.

DOI
10.1109/icicic.2007.154

Related papers

A Dynamic ID-based Authenticated Group Key Agreement Protocol

Jun Zheng, Cheng Yang, Jinrong Xue +1 more

Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.

National Conference on Electrical, Electronics and Computer Engineering (NCEECE)•Jan 1, 2016•12 citations

An Efficient Authenticated Group Key Agreement Protocol

Yongzhong He, Han Zhen

Authenticated group key agreement is an important cryptographic mechanism underlying many collaborative and distributed applications. Some identity-based authenticated group key agreement schemes are proposed, however most of these protocols are vulnerable to insider attacks, while the other protocols are not efficient in communication. In this paper a new authenticated group key agreement protocol is proposed based on a modified identity-based cryptography infrastructure with new system setup and key extraction algorithms. The main feature of this protocol is that it needs only one round, which is optimal in terms of communication complexity; meanwhile the protocol is secure against insider attacks such as impersonation attacks and other known attacks.

IEEE International Carnahan Conference on Security Technology (ICCST)•Oct 1, 2007•13 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

Security properties of two authenticated conference key agreement protocols

Qiang Tang

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

•Jan 1, 2005•0 citations

Insider Impersonation Attack on a Tripartite ID-Based Authenticated Key Agreement Protocol with Bilinear Pairings

Meng-Hui Lim, Sang-Gon Lee, Hoon Jae Lee

A key agreement protocol is designed for two or more entities to agree upon a shared secret key, which can subsequently be used to preserve confidentiality and data integrity over an open network. Since Joux has pioneered the notion of pairing-based tripartite key agreement protocol, various group key agreement schemes have been proposed after then. In 2003, Liu et al. proposed a tripartite identity-based authenticated key agreement protocol using bilinear pairings. Although the scheme is claimed to be efficient and secure, we discover that it is in fact breakable. In this paper, we highlight the flaw by demonstrating an insider impersonation attack on the scheme and suggest a few enhancements to conquer the defect.

International Conference on Next Generation Web Services Practices•Oct 1, 2008•1 citation

Improved ID-based Authenticated Group Key Agreement Secure Against Impersonation Attack by Insider

Hyewon Park, Tomoyuki Asano, Kwangjo Kim

Many conference systems over the Internet require authenticated group key agreement (AGKA) for secure and reliable communication. After Shamir [1] proposed the ID-based cryptosystem in 1984, ID-based AGKA protocols have been actively studied because of the simple public key management. In 2006, Zhou et al. [12] proposed two-round ID-based AGKA protocol which is very efficient in communication and computation complexity. However, their protocol does not provide user identification and suffers from the impersonation attack by malicious participants. In this paper, we propose improved ID-based AGKA protocol to prevent impersonation attack from Zhou et al.'s protocol. In our protocol, the malicious insider cannot impersonate another participants even if he knows the ephemeral group secret value. Moreover, our protocol reduces the computation cost from Zhou et al.'s protocol.

Information Security and Cryptology•Oct 1, 2009•4 citations
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.
Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.
Authenticated group key agreement is an important cryptographic mechanism underlying many collaborative and distributed applications. Some identity-based authenticated group key agreement schemes are proposed, however most of these protocols are vulnerable to insider attacks, while the other protocols are not efficient in communication. In this paper a new authenticated group key agreement protocol is proposed based on a modified identity-based cryptography infrastructure with new system setup and key extraction algorithms. The main feature of this protocol is that it needs only one round, which is optimal in terms of communication complexity; meanwhile the protocol is secure against insider attacks such as impersonation attacks and other known attacks.
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.
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
A key agreement protocol is designed for two or more entities to agree upon a shared secret key, which can subsequently be used to preserve confidentiality and data integrity over an open network. Since Joux has pioneered the notion of pairing-based tripartite key agreement protocol, various group key agreement schemes have been proposed after then. In 2003, Liu et al. proposed a tripartite identity-based authenticated key agreement protocol using bilinear pairings. Although the scheme is claimed to be efficient and secure, we discover that it is in fact breakable. In this paper, we highlight the flaw by demonstrating an insider impersonation attack on the scheme and suggest a few enhancements to conquer the defect.
Many conference systems over the Internet require authenticated group key agreement (AGKA) for secure and reliable communication. After Shamir [1] proposed the ID-based cryptosystem in 1984, ID-based AGKA protocols have been actively studied because of the simple public key management. In 2006, Zhou et al. [12] proposed two-round ID-based AGKA protocol which is very efficient in communication and computation complexity. However, their protocol does not provide user identification and suffers from the impersonation attack by malicious participants. In this paper, we propose improved ID-based AGKA protocol to prevent impersonation attack from Zhou et al.'s protocol. In our protocol, the malicious insider cannot impersonate another participants even if he knows the ephemeral group secret value. Moreover, our protocol reduces the computation cost from Zhou et al.'s protocol.