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 JOURNAL ON Advances in Information Sciences and Service Sciences

A Flexible ID-based Key Agreement Protocol in Group Communication

Pengshuai Qiao

Published Feb 27, 2013• 0 citations
Publisher
DOI
10.4156/aiss.vol5.issue4.61

Related papers

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Pengshuai Qiao

TELKOMNIKA Indonesian Journal of Electrical Engineering•Oct 1, 2014•0 citations

A Dynamic ID Based Authenticated Group Key Agreement Protocol from Pairing.

Shruti Nathani, B. P. Tripathi, Shaheena Khatoon

International journal of network security•Jan 1, 2019•9 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

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

An Efficient ID-Based Authenticated Key Agreement Protocol with Pairings

Jai-Boo Oh, Eun‐Jun Yoon, Kee-Young Yoo

Lecture notes in computer science•Jan 1, 2007•14 citations

A Flexible ID-Based Group Key Agreement Protocol with Bilinear Pairings

Jun Liang, Hyeong Seon Yoo

A secure and efficient key agreement protocols should provide certain security attributes and low computation overhead. However, most of published protocols cannot provide perfect forward secrecy and avoid key escrow by the Key Generation Center (KGC). In this paper we propose a flexible protocol that can satisfy these security attributes. Moreover the proposed protocol can provide lower computation cost since we can arbitrarily construct subgroups.

CRC Press eBooks•May 7, 2019•0 citations
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.
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.