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

arXiv:2312.04107

Dynamic Quantum Group Key Agreement via Tree Key Graphs

Qiang Zhao, Zhuohua Li, John C. S. Lui

Published Dec 7, 2023• 0 citations
arXivHTMLPDF

Abstract

Quantum key distribution (QKD) protocols are essential to guarantee information-theoretic security in quantum communication. Although there was some previous work on quantum group key distribution, they still face many challenges under a ``\textit{dynamic}'' group communication scenario. In particular, when the group keys need to be updated in real-time for each user joining or leaving to ensure secure communication properties, i.e., forward confidentiality and backward confidentiality. However, current protocols require a large amount of quantum resources to update the group keys, and this makes them impractical for handling large and dynamic communication groups. In this paper, we apply the notion of ``{\em tree key graph}'' to the quantum key agreement and propose two dynamic Quantum Group Key Agreement (QGKA) protocols for a join or leave request in group communications. In addition, we analyze the quantum resource consumption of our proposed protocols. The number of qubits required per join or leave only increases logarithmically with the group size. As a result, our proposed protocols are more practical and scalable for large and dynamic quantum group communications.

DOI
10.48550/arxiv.2312.04107

Related papers

Proficient key management scheme for multicast groups using group key agreement and broadcast encryption

E. Abirami, T. Padmavathy

Key Management techniques are exercised to distribute and update keys such that illegitimate parties cannot ingress group communications. Key management, however can exhibit information about the stream of group association, such as group size and the number of joining and leaving users. This is a threat to applications with confidential group membership information. This project proposes a new key management paradigm which a combination of traditional broadcast encryption and group key agreement which never reveals the group dynamic information to outsiders and achieves both forward secrecy and backward secrecy. It provides a secure key management model not only with public and private key but also two more keys called group key and session key. It is distributed to multiple user overtime. It also overcomes the limitation of quantum point to point key sharing. It offers reliability and convenience of use, as well as to introduce a secure and efficient key management technique for any quantum cryptography network in real time.

International Conference on Information Communication and Embedded Systems•Feb 1, 2017•4 citations

Round-optimal ID-based dynamic authenticated group key agreement

Fei Li, Dongqing Xie, Wei Gao +2 more

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.

International Journal of High Performance Systems Architecture•Jan 1, 2016•0 citations

A Lattice-Based Dynamic Group Authenticated Key Exchange Protocol

Rui Zhang, Liquan Chen, Suhui Liu +2 more

Group Authenticated Key Exchange (GAKE) protocol can achieve authentication among multiple users within a group and facilitates the agreement on a consistent group key, which ensures the security of the transmission of data within the group. Society is entering the post-quantum era with the development of quantum computers, and traditional cryptographic algorithms used in existing group authenticated key exchange protocols may not be able to resist quantum attacks. Using the lattice-based key encapsulation mechanism Kyber, we have developed a post-quantum secure group key exchange protocol. The protocol incorporates dynamic joining and leaving phases for group users to ensure scalability, while also utilizing passwords for user authentication. Finally, we formally prove the security of the protocol and compare it with other lattice-based group authenticated key exchange protocols through simulation experiments, the results demonstrate that our protocol is more efficient.

IEEE International Conference on Computer and Communications (ICCC)•Dec 13, 2024•0 citations

Dynamic Group Multi-party Quantum Key Agreement

Yao–Hsin Chou, Guo-Jyun Zeng, Zhe-Hua Chang +1 more

This paper presents a novel dynamic group multi-party Quantum Key Agreement (DGMQKA) protocol, achieved by a multicast transmission method. The proposed method is able to achieve arbitrary number of groups and members under the same resources. In addition, it can be dynamically adjusted by joining a new member, combining two groups into one group, revoking an old member and dividing one group into two groups, for different and complex situations. Furthermore, the proposed protocol can be of help to research into Quantum Secret Sharing (QSS), which it complements. The security analysis shows that the proposed protocol can resist both external and internal attacks. In consumption comparison, the proposed protocol using the multicast transmission method is more effective than other current MQKA protocols.

Scientific Reports•Mar 9, 2018•19 citations

Round-optimal ID-based dynamic authenticated group key agreement

Xu An Wang, Jianhua Yan, Dongqing Xie +2 more

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.

International Journal of High Performance Systems Architecture•Jan 1, 2016•0 citations

A New Group Key Agreement Protocol with Anonymity

Gang Yao, Li Guo

Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.

Applied Mechanics and Materials•Aug 30, 2013•0 citations
Quantum key distribution (QKD) protocols are essential to guarantee information-theoretic security in quantum communication. Although there was some previous work on quantum group key distribution, they still face many challenges under a \textit{dynamic}'' group communication scenario. In particular, when the group keys need to be updated in real-time for each user joining or leaving to ensure secure communication properties, i.e., forward confidentiality and backward confidentiality. However, current protocols require a large amount of quantum resources to update the group keys, and this makes them impractical for handling large and dynamic communication groups. In this paper, we apply the notion of {\em tree key graph}'' to the quantum key agreement and propose two dynamic Quantum Group Key Agreement (QGKA) protocols for a join or leave request in group communications. In addition, we analyze the quantum resource consumption of our proposed protocols. The number of qubits required per join or leave only increases logarithmically with the group size. As a result, our proposed protocols are more practical and scalable for large and dynamic quantum group communications.
Key Management techniques are exercised to distribute and update keys such that illegitimate parties cannot ingress group communications. Key management, however can exhibit information about the stream of group association, such as group size and the number of joining and leaving users. This is a threat to applications with confidential group membership information. This project proposes a new key management paradigm which a combination of traditional broadcast encryption and group key agreement which never reveals the group dynamic information to outsiders and achieves both forward secrecy and backward secrecy. It provides a secure key management model not only with public and private key but also two more keys called group key and session key. It is distributed to multiple user overtime. It also overcomes the limitation of quantum point to point key sharing. It offers reliability and convenience of use, as well as to introduce a secure and efficient key management technique for any quantum cryptography network in real time.
A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.
Group Authenticated Key Exchange (GAKE) protocol can achieve authentication among multiple users within a group and facilitates the agreement on a consistent group key, which ensures the security of the transmission of data within the group. Society is entering the post-quantum era with the development of quantum computers, and traditional cryptographic algorithms used in existing group authenticated key exchange protocols may not be able to resist quantum attacks. Using the lattice-based key encapsulation mechanism Kyber, we have developed a post-quantum secure group key exchange protocol. The protocol incorporates dynamic joining and leaving phases for group users to ensure scalability, while also utilizing passwords for user authentication. Finally, we formally prove the security of the protocol and compare it with other lattice-based group authenticated key exchange protocols through simulation experiments, the results demonstrate that our protocol is more efficient.
This paper presents a novel dynamic group multi-party Quantum Key Agreement (DGMQKA) protocol, achieved by a multicast transmission method. The proposed method is able to achieve arbitrary number of groups and members under the same resources. In addition, it can be dynamically adjusted by joining a new member, combining two groups into one group, revoking an old member and dividing one group into two groups, for different and complex situations. Furthermore, the proposed protocol can be of help to research into Quantum Secret Sharing (QSS), which it complements. The security analysis shows that the proposed protocol can resist both external and internal attacks. In consumption comparison, the proposed protocol using the multicast transmission method is more effective than other current MQKA protocols.
A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.
Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.