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

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)

An Improved secure certificateless authenticated group key agreement protocol

Manman Geng, Futai Zhang

Published Nov 1, 2009• 1 citation
Publisher

Abstract

In modern collaborative and distributed applications, authenticated group key agreement (AGKA) is one of the important issues. In this paper, we present that one existing certificateless AGKA protocol has some security drawbacks and does not satisfy some security attributes required for AGKA protocols. To overcome its drawbacks, we propose a secure and efficient protocol upon the initial one and a signature scheme proved secure in the random oracle model. The security analysis shows that our improved protocol can achieve Explicit key authentication, Known session key security, Known ephemeral secrets security, Perfect forward security, No key compromise impersonation, No key control and No unknown key share. With respect to efficiency, our protocol only needs three communication rounds. In each protocol run, only three pairing computations are involved for each participant.

DOI
10.1109/icicisys.2009.5358158

Related papers

A Secure Certificateless Authenticated Group Key Agreement Protocol

Manman Geng, Futai Zhang, Meng Gao

We present an efficient authenticated group key agreement (AGKA) protocol in certificateless public key setting (CL-AGKA). The protocol only needs two communication rounds. In each protocol run, only four pairing computations are involved for each participant. The authentication in our protocol is realized using a signature scheme which is provably secure in the strongest security model for certificateless signature (CLS) schemes where the type I/II adversary is a super type I/II adversary. The security analysis shows our protocol satisfies Key authentication, Known session key security, Key compromise impersonation security, Perfect forward security, and Known session-specific temporary information security.

International Conference on Multimedia Information Networking and Security•Jan 1, 2009•13 citations

A Certificateless-based One-Round Authenticated Group Key Agreement Protocol to Prevent Impersonation Attacks

Huimin Ren, Suhyun Kim, Daehee Seo +1 more

With the development of multiuser online meetings, more group-oriented technologies and applications for instance collaborative work are becoming increasingly important.Authenticated Group Key Agreement (AGKA) schemes provide a shared group key for users with after their identities are confirmed to guarantee the confidentiality and integrity of group communications.On the basis of the Public Key Cryptography (PKC) system used, AGKA can be classified as Public Key Infrastructure-based, Identity-based, and Certificateless.Because the latter type can solve the certificate management overhead and the key escrow problems of the first two types, Certificateless-AGKA (CL-AGKA) protocols have become a popular area of research.However, most CL-AGKA protocols are vulnerable to Public Key Replacement Attacks (PKRA) due to the lack of public key authentication.In the present work, we present a CL-AGKA scheme that can resist PKRA in order to solve impersonation attacks caused by those attacks.Beyond security, improving scheme efficiency is another direction for AGKA research.To reduce the communication and computation cost, we present a scheme with only one round of information interaction and construct a CL-AGKA scheme replacing the bilinear pairing with elliptic curve cryptography.Therefore, our scheme has good applicability to communication environments with limited bandwidth and computing capabilities.

KSII Transactions on Internet and Information Systems•May 31, 2022•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

An Efficient Group Key Exchange Protocol from Pairings

Lung-Chung Li, Yao-Pin Tsai, Ru‐Sheng Liu

Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.

International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA)•Apr 1, 2008•0 citations

A novel ID-based authenticated group key agreement protocol using bilinear pairings

Lung-Chung Li, Yao-Pin Tsai, Ru‐Sheng Liu

Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.

IFIP International Conference on Wireless and Optical Communications Networks (WOCN)•May 1, 2008•6 citations

An efficient and secure one-round authenticated key agreement protocol without pairings

Mengbo Hou, Qiuliang Xu

Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.

International Conference on Multimedia Technology (ICMT)•Jul 1, 2011•4 citations
In modern collaborative and distributed applications, authenticated group key agreement (AGKA) is one of the important issues. In this paper, we present that one existing certificateless AGKA protocol has some security drawbacks and does not satisfy some security attributes required for AGKA protocols. To overcome its drawbacks, we propose a secure and efficient protocol upon the initial one and a signature scheme proved secure in the random oracle model. The security analysis shows that our improved protocol can achieve Explicit key authentication, Known session key security, Known ephemeral secrets security, Perfect forward security, No key compromise impersonation, No key control and No unknown key share. With respect to efficiency, our protocol only needs three communication rounds. In each protocol run, only three pairing computations are involved for each participant.
We present an efficient authenticated group key agreement (AGKA) protocol in certificateless public key setting (CL-AGKA). The protocol only needs two communication rounds. In each protocol run, only four pairing computations are involved for each participant. The authentication in our protocol is realized using a signature scheme which is provably secure in the strongest security model for certificateless signature (CLS) schemes where the type I/II adversary is a super type I/II adversary. The security analysis shows our protocol satisfies Key authentication, Known session key security, Key compromise impersonation security, Perfect forward security, and Known session-specific temporary information security.
With the development of multiuser online meetings, more group-oriented technologies and applications for instance collaborative work are becoming increasingly important.Authenticated Group Key Agreement (AGKA) schemes provide a shared group key for users with after their identities are confirmed to guarantee the confidentiality and integrity of group communications.On the basis of the Public Key Cryptography (PKC) system used, AGKA can be classified as Public Key Infrastructure-based, Identity-based, and Certificateless.Because the latter type can solve the certificate management overhead and the key escrow problems of the first two types, Certificateless-AGKA (CL-AGKA) protocols have become a popular area of research.However, most CL-AGKA protocols are vulnerable to Public Key Replacement Attacks (PKRA) due to the lack of public key authentication.In the present work, we present a CL-AGKA scheme that can resist PKRA in order to solve impersonation attacks caused by those attacks.Beyond security, improving scheme efficiency is another direction for AGKA research.To reduce the communication and computation cost, we present a scheme with only one round of information interaction and construct a CL-AGKA scheme replacing the bilinear pairing with elliptic curve cryptography.Therefore, our scheme has good applicability to communication environments with limited bandwidth and computing capabilities.
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.
Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.
Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.
Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.