© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

IET Information Security

Dynamic asymmetric group key agreement protocol with traitor traceability

Jikai Teng, Hongyang Ma

Published Oct 7, 2019• 17 citations

Abstract

In asymmetric group key agreement (ASGKA) protocols, a group of users establish a common encryption key which is publicly accessible and compute pairwise different decryption keys. It is left as an open problem to design an ASGKA protocol with traitor traceability in Eurocrypt 2009. A one‐round dynamic authenticated ASGKA protocol with public traitor traceability is proposed in this study. It provides a black‐box tracing algorithm. Ind‐CPA security with key compromise impersonation resilience (KCIR) and forward secrecy of ASGKA protocols is formally defined. The proposed protocol is proved to be Ind‐CPA secure with KCIR and forward secrecy under D k ‐HDHE assumption. It is also proved that the proposed protocol resists collusion attack. In Setup algorithm and Join algorithm, one communication round is required. In Leave algorithm, no message is required to be transmitted. The proposed protocol adopts ‐way asymmetric multilinear map to make the size of public key and the size of ciphertext both achieve , where N is the number of potential group members. This is the first ASGKA protocol with public traitor traceability which is more efficient than trivial construction of ASGKA protocols.

DOI: 10.1049/iet-ifs.2019.0177

Related papers

Asymmetric Group Key Agreement with Traitor Traceability

Qiuliang Xu

The notion of asymmetric group key agreement(ASGKA) was first introduced in EuroCrypt 2009,in which the group members merely negotiate a common encryption key which is accessible to attackers and corresponds to different decryption keys,each of which is only computable by one group member.One of the future works is to achieve asymmetric group key agreement with traitor traceability.In this paper,we proposed a provable security asymmetric group key agreement protocol ASGKAwTT in standard model,the new protocol provides traitor traceability.

•Jan 1, 2011•0 citations

Asymmetric Group Key Agreement with Traitor Traceability

Xiufeng Zhao, Wei Da-wei, Hao Wang

Recently, the notion of asymmetric group key agreement (ASGKA) 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 propose an ASGKA protocol with traitor traceability. The new scheme achieves most of known security attributes, such as session key secrecy, known-key secrecy and forward secrecy. In addition, the protocol can provide traitor traceability.

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2010•8 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

Asymmetric Group Key Agreement Protocol from Short Signatures

Kunyu Shen, Lei Zhang, Rui Zhang +1 more

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.

IEEE International Conference on Computer and Communications (ICCC)•Dec 9, 2022•3 citations

Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications

Lei Zhang, Qianhong Wu, Josep Domingo‐Ferrer +2 more

Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the k -bilinear Diffie-Hellman exponent assumption.

IEEE Transactions on Information Forensics and Security•Jun 19, 2015•69 citations

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Yong Gan, Bingli Wang, Yuan Zhuang +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•1 citation

In asymmetric group key agreement (ASGKA) protocols, a group of users establish a common encryption key which is publicly accessible and compute pairwise different decryption keys. It is left as an open problem to design an ASGKA protocol with traitor traceability in Eurocrypt 2009. A one‐round dynamic authenticated ASGKA protocol with public traitor traceability is proposed in this study. It provides a black‐box tracing algorithm. Ind‐CPA security with key compromise impersonation resilience (KCIR) and forward secrecy of ASGKA protocols is formally defined. The proposed protocol is proved to be Ind‐CPA secure with KCIR and forward secrecy under D k ‐HDHE assumption. It is also proved that the proposed protocol resists collusion attack. In Setup algorithm and Join algorithm, one communication round is required. In Leave algorithm, no message is required to be transmitted. The proposed protocol adopts ‐way asymmetric multilinear map to make the size of public key and the size of ciphertext both achieve , where N is the number of potential group members. This is the first ASGKA protocol with public traitor traceability which is more efficient than trivial construction of ASGKA protocols.

The notion of asymmetric group key agreement(ASGKA) was first introduced in EuroCrypt 2009,in which the group members merely negotiate a common encryption key which is accessible to attackers and corresponds to different decryption keys,each of which is only computable by one group member.One of the future works is to achieve asymmetric group key agreement with traitor traceability.In this paper,we proposed a provable security asymmetric group key agreement protocol ASGKAwTT in standard model,the new protocol provides traitor traceability.

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 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.

Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the k -bilinear Diffie-Hellman exponent assumption.

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.