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 Computer and Communications (ICCC)

Asymmetric Group Key Agreement Protocol from Short Signatures

Kunyu Shen, Lei Zhang, Rui Zhang, Qihao Fang

Published Dec 9, 2022• 3 citations
Publisher

Abstract

Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem.

DOI
10.1109/iccc56324.2022.10065683

Related papers

Authenticated Asymmetric Group Key Agreement Protocol and Its Application

L. Zhang, Qianhong Wu, B. Qin

A recent primitive known as asymmetric group key agreement allows a group of users to negotiate a common encryption key which is accessible to any entities while each user holds her respective secret decryption key. This concept not only enables confidential communications among group users but also permits any outsider to send encrypted messages to the group. The existing instantiation is only secure against passive adversaries. In this paper, we first propose an authenticated asymmetric group key agreement protocol which captures the practical security properties against active attacks. Based on our protocol, we then propose a broadcast encryption system without relying on a trusted dealer to distribute the secret keys to the users. Our system has also short ciphertexts. Furthermore, the proposal is equipped with the perfect forward security property.

International Conference on Communications•May 1, 2010•12 citations

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol.

Lei Zhang, Qianhong Wu, Bo Qin +1 more

Abstract. In identity-based public-key cryptography, an entity’s public key can be easily derived from its identity. The direct derivation of public keys in identity-based public-key cryptography eliminates the need for certificates and solves certain public key management problems in traditional public-key cryptosystems. Recently, the notion of asymmetric group key agreement was introduced, in which the group members merely negotiate a common encryption key which is accessible to any entity, but they hold respective secret decryption keys. In this paper, we first propose a security model for identity-based authenticated asymmetric group key agreement (IB-AAGKA) protocols. We then propose an IB-AAGKA protocol which is proven secure under the Bilinear Diffie-Hellman Exponent assumption. Our protocol is also efficient, and readily adaptable to provide broadcast encryption.

•Jan 1, 2010•0 citations

Efficient Certificateless Authenticated Asymmetric Group Key Agreement Protocol

Guiyi Wei

Group key agreement (GKA) is a cryptographic primitive allowing two or more users to negotiate a shared session key over public networks.Wu et al. recently introduced the concept of asymmetric GKA that allows a group of users to negotiate a common public key, while each user only needs to hold his/her respective private key.However, Wu et al.'s protocol can not resist active attacks, such as fabrication.To solve this problem, Zhang et al. proposed an authenticated asymmetric GKA protocol, where each user is authenticated during the negotiation process, so it can resist active attacks.Whereas, Zhang et al.'s protocol needs a partially trusted certificate authority to issue certificates, which brings a heavy certificate management burden.To eliminate such cost, Zhang et al. constructed another protocol in identity-based setting.Unfortunately, it suffers from the so-called key escrow problem.In this paper, we propose the certificateless authenticated asymmetric group key agreement protocol which does not have certificate management burden and key escrow problem.Besides, our protocol achieves known-key security, unknown key-share security, key-compromise impersonation security, and key control security.Our simulation based on the pairing-based cryptography (PBC) library shows that this protocol is efficient and practical.

KSII Transactions on Internet and Information Systems•Jan 1, 2012•29 citations

Authenticated asymmetric group key agreement based on certificateless cryptosystem

Xixiang Lv, Hui Li, Baocang Wang

A recent primitive known as asymmetric group key agreement (AGKA) allows a group of users to negotiate a common encryption key which is accessible to any entities and corresponds to different decryption keys, each of which is only computable by one group member. This concept makes it easy to construct distributed and one-round group key agreement protocols. However, this existing instantiation depends on public key infrastructure (PKI) associated with certificate management, or it is only secure against passive adversaries. This paper addresses this concern by designing a certificateless authenticated AGKA scheme, which does not require certificates to guarantee the authenticity of public keys yet avoids the inherent escrow problem of identity-based cryptosystems. Using simple binding techniques, the proposed scheme can be raised to the same trust level as that using the traditional PKI. We show that the proposed protocol is secure provided that the underlying k-bilinear Diffie–Hellman exponent problem is hard.

International Journal of Computer Mathematics•May 24, 2013•25 citations

AD‐ASGKA – authenticated dynamic protocols for asymmetric group key agreement

Mingchu Li, Xiaodong Xu, Cheng Guo +1 more

Abstract Asymmetric group key agreement is a cryptographic primitive allowing a group of users to negotiate a common public encryption key while each of them holds a different secret private decryption key. Anyone (including outsiders) with the public encryption key can send encrypted messages to the group members, and then the group members can decrypt the messages. Authenticated key agreement protocols authenticate the identities of users to ensure that only the intended group members can establish a session in which the group members can communicate with each other. Dynamic asymmetric group key agreement concerns about the scenarios such as ad hoc networks in which the group members may join or leave at any given time. In this paper, we propose a one‐round authenticated dynamic protocol for symmetric group key agreement. For efficiency reasons, we employ the identity‐based public‐key cryptography (IB‐PKC) to authenticate users rather than the public key infrastructure and the certificate‐less public‐key cryptography. Our analysis shows that the proposals in the paper can resist active attacks and meet many desirable security attributes. Besides, our protocol allows users to join or leave the group at the same time. Furthermore, our protocol is round‐optimal and has a quite good performance as compared with previous works. Copyright © 2016 John Wiley & Sons, Ltd.

Security and Communication Networks•Jan 26, 2016•14 citations

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Qikun Zhang, Zengyu Cai, Yong Gan +2 more

Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.

International Journal of Embedded Systems•Jan 1, 2019•0 citations
Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem.
A recent primitive known as asymmetric group key agreement allows a group of users to negotiate a common encryption key which is accessible to any entities while each user holds her respective secret decryption key. This concept not only enables confidential communications among group users but also permits any outsider to send encrypted messages to the group. The existing instantiation is only secure against passive adversaries. In this paper, we first propose an authenticated asymmetric group key agreement protocol which captures the practical security properties against active attacks. Based on our protocol, we then propose a broadcast encryption system without relying on a trusted dealer to distribute the secret keys to the users. Our system has also short ciphertexts. Furthermore, the proposal is equipped with the perfect forward security property.
Abstract. In identity-based public-key cryptography, an entity’s public key can be easily derived from its identity. The direct derivation of public keys in identity-based public-key cryptography eliminates the need for certificates and solves certain public key management problems in traditional public-key cryptosystems. Recently, the notion of asymmetric group key agreement was introduced, in which the group members merely negotiate a common encryption key which is accessible to any entity, but they hold respective secret decryption keys. In this paper, we first propose a security model for identity-based authenticated asymmetric group key agreement (IB-AAGKA) protocols. We then propose an IB-AAGKA protocol which is proven secure under the Bilinear Diffie-Hellman Exponent assumption. Our protocol is also efficient, and readily adaptable to provide broadcast encryption.
Group key agreement (GKA) is a cryptographic primitive allowing two or more users to negotiate a shared session key over public networks.Wu et al. recently introduced the concept of asymmetric GKA that allows a group of users to negotiate a common public key, while each user only needs to hold his/her respective private key.However, Wu et al.'s protocol can not resist active attacks, such as fabrication.To solve this problem, Zhang et al. proposed an authenticated asymmetric GKA protocol, where each user is authenticated during the negotiation process, so it can resist active attacks.Whereas, Zhang et al.'s protocol needs a partially trusted certificate authority to issue certificates, which brings a heavy certificate management burden.To eliminate such cost, Zhang et al. constructed another protocol in identity-based setting.Unfortunately, it suffers from the so-called key escrow problem.In this paper, we propose the certificateless authenticated asymmetric group key agreement protocol which does not have certificate management burden and key escrow problem.Besides, our protocol achieves known-key security, unknown key-share security, key-compromise impersonation security, and key control security.Our simulation based on the pairing-based cryptography (PBC) library shows that this protocol is efficient and practical.
A recent primitive known as asymmetric group key agreement (AGKA) allows a group of users to negotiate a common encryption key which is accessible to any entities and corresponds to different decryption keys, each of which is only computable by one group member. This concept makes it easy to construct distributed and one-round group key agreement protocols. However, this existing instantiation depends on public key infrastructure (PKI) associated with certificate management, or it is only secure against passive adversaries. This paper addresses this concern by designing a certificateless authenticated AGKA scheme, which does not require certificates to guarantee the authenticity of public keys yet avoids the inherent escrow problem of identity-based cryptosystems. Using simple binding techniques, the proposed scheme can be raised to the same trust level as that using the traditional PKI. We show that the proposed protocol is secure provided that the underlying k-bilinear Diffie–Hellman exponent problem is hard.
Abstract Asymmetric group key agreement is a cryptographic primitive allowing a group of users to negotiate a common public encryption key while each of them holds a different secret private decryption key. Anyone (including outsiders) with the public encryption key can send encrypted messages to the group members, and then the group members can decrypt the messages. Authenticated key agreement protocols authenticate the identities of users to ensure that only the intended group members can establish a session in which the group members can communicate with each other. Dynamic asymmetric group key agreement concerns about the scenarios such as ad hoc networks in which the group members may join or leave at any given time. In this paper, we propose a one‐round authenticated dynamic protocol for symmetric group key agreement. For efficiency reasons, we employ the identity‐based public‐key cryptography (IB‐PKC) to authenticate users rather than the public key infrastructure and the certificate‐less public‐key cryptography. Our analysis shows that the proposals in the paper can resist active attacks and meet many desirable security attributes. Besides, our protocol allows users to join or leave the group at the same time. Furthermore, our protocol is round‐optimal and has a quite good performance as compared with previous works. Copyright © 2016 John Wiley & Sons, Ltd.
Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.