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:2603.03225 · Computer Science Review

Multiparty Quantum Key Agreement: Architectures, State-of-the-art, and Open Problems

Malik Mouaji, Saif Al-Kuwari

quant-phcs.CRmath-phSubmitted Mar 3, 2026• Announced Mar 4, 2026• 0 citations
arXivHTMLPDF

Abstract

Multiparty quantum key agreement (MQKA) enables $n \geq 3$ mutually distrustful users to establish a shared secret key through collaborative quantum protocols. In this paper, we provide a comprehensive review where we argue that MQKA is best understood as a design space organized along three orthogonal but tightly coupled axes: (1) network architecture, which determines how quantum states flow between participants; (2) quantum resources, which encode the physical degrees of freedom used for implementation; and (3) security model, which defines trust assumptions about devices and infrastructure. Rather than treating MQKA as a linear sequence of isolated protocols, we develop this three-axis perspective to reveal recurrent patterns, sharp trade-offs, and unexplored design spaces. We classify MQKA protocols into structural families, map them to underlying quantum resources, and analyze how different security models shape fairness and collusion resistance. We further identify open challenges in composable security frameworks, network native integration, device-independent implementations, and propose a research roadmap toward hybrid-resource, bosonic-code-encoded, and fairness-aware MQKA suitable for the future quantum internet deployments in the post-NISQ era.

Related papers

Multiparty quantum key agreement protocol secure against collusion attacks

Zhiwei Sun, Xiaoqiang Sun, Ping Wang

The fairness of a secure multi-party quantum key agreement (MQKA) protocol requires that all involved parties are entirely peer entities and can equally influence the outcome of the protocol to establish a shared key wherein no one can decide the shared key alone. However, it is found that parts of the existing MQKA protocols are sensitive to collusion attacks, i.e., some of the dishonest participants can collaborate to predetermine the final key without being detected. In this paper, a multi-party QKA protocol resisting collusion attacks is proposed. Different from previous QKA protocol resisting $N-1$ coconspirators or resisting $1$ coconspirators, we investigate the general circle-type MQKA protocol which can be secure against $t$ dishonest participants' cooperation. Here, $t < N$. We hope the results of the presented paper will be helpful for further research on fair MQKA protocols.

arXiv:1604.01112•Apr 5, 2016•9 citations

High-dimensional GHZ-based multi-party quantum key agreement: rigorous security, fairness, and loss tolerance

Hamza Sohail, Burhan Ul Islam Khan, Nur Fatin Liyana Mohd Rosely +4 more

Abstract Multi-party quantum key agreement (MQKA) enables a group of mutually untrusted users to jointly establish a secret key with equal influence, a capability not provided by two-party quantum key distribution (QKD) and increasingly relevant for securing resilient infrastructure such as quantum-enabled smart grid networks and distributed cyber-physical systems. We present a high-dimensional Greenberger-Horne-Zeilinger (GHZ)-based MQKA that simultaneously targets rigorous security, provable fairness, and practical loss tolerance. The protocol distributes an N -partite d -level GHZ state in a star (with an optional star-of-stars hierarchy for large N ) and maps each user’s contribution to local $X_{d}^{a} Z_{d}^{b}$ X d a Z d b operations. A commit-then-reveal layer makes inputs binding and hiding, yielding equal influence fairness over $\mathbb{Z}_{d}$ Z d with a strict fair-abort guarantee. Composable secrecy is established via entropy bounds and a Devetak-Winter-style key rate analysis, strengthened by test-round statistics; we connect Mermin/Svetlichny-type correlators to min-entropy lower bounds and incorporate full leakage accounting and finite-key penalties. We model depolarizing, shift/phase (Weyl), amplitude-damping, erasures, detector efficiency, and dark counts, and derive closed-form mappings from device parameters to symbol/phase errors. Monte Carlo studies confirm that $d>2$ d > 2 expands the positive-rate region and reduces the global survival required for a given throughput compared with qubit GHZ MQKA under identical conditions. We discuss potential photonic realizations (time-bin or frequency-bin encoding, discrete Fourier transform networks, and superconducting nanowire detectors) and architectural pathways toward larger N via hierarchical clustering, while acknowledging the significant technological challenges that would need to be overcome to realize high-dimensional multipartite entanglement experimentally. Overall, the scheme delivers higher efficiency per entangled state, rigorous fairness, and composable security with realistic noise and loss, addressing key gaps in current MQKA designs for resilient infrastructure.

EPJ Quantum Technology•Apr 23, 2026•0 citations

New Fair Multiparty Quantum Key Agreement Secure against Collusive Attacks

Zhiwei Sun, Rong Cheng, Chunhui Wu +1 more

Fairness is an important standard needed to be considered in a secure quantum key agreement (QKA) protocol. However, it found that most of the quantum key agreement protocols in the travelling model are not fair, i.e., some of the dishonest participants can collaborate to predetermine the final key without being detected. Thus, how to construct a fair and secure key agreement protocol has obtained much attention. In this paper, a new fair multiparty QKA protocol that can resist the collusive attack is proposed. More specifically, we show that in a client-server scenario, it is possible for the clients to share a key and reveal nothing about what key has been agreed upon to the server. The server prepares quantum states for clients to encode messages to avoid the participants' collusive attack. This construction improves on previous work, which requires either preparing multiple quantum resources by clients or two-way quantum communication. It is proven that the protocol does not reveal to any eavesdropper, including the server, what key has been agreed upon, and the dishonest participants can be prevented from collaborating to predetermine the final key.

Scientific Reports•Nov 20, 2019•14 citations

Efficient multiparty quantum key agreement with collective detection

Wei Huang, Qi Su, Bin Liu +3 more

As a burgeoning branch of quantum cryptography, quantum key agreement is a kind of key establishing processes where the security and fairness of the established common key should be guaranteed simultaneously. However, the difficulty on designing a qualified quantum key agreement protocol increases significantly with the increase of the number of the involved participants. Thus far, only few of the existing multiparty quantum key agreement (MQKA) protocols can really achieve security and fairness. Nevertheless, these qualified MQKA protocols are either too inefficient or too impractical. In this paper, an MQKA protocol is proposed with single photons in travelling mode. Since only one eavesdropping detection is needed in the proposed protocol, the qubit efficiency and measurement efficiency of it are higher than those of the existing ones in theory. Compared with the protocols which make use of the entangled states or multi-particle measurements, the proposed protocol is more feasible with the current technologies. Security and fairness analysis shows that the proposed protocol is not only immune to the attacks from external eavesdroppers, but also free from the attacks from internal betrayers.

Scientific Reports•Nov 6, 2017•33 citations

Multiparty quantum key agreement based on Grover’s algorithm and its implementation

Aihan Yin, Zhifei Han

Multiparty quantum key agreement (MQKA) is a significant topic that the shared key must be negotiated equally by all participants. In this paper, we use Bell state as quantum resource and add controlled-not gate to avoid information leakage. There is very little research on the quantum key agreement protocol based on quantum search algorithms. Therefore, we propose a quantum key agreement protocol which is based on Grover’s algorithm as one of the most famous quantum search algorithms. The security analysis appears very promising.

Modern Physics Letters A•Oct 24, 2018•2 citations

Multiparty quantum key agreement

Song Lin, Xin Zhang, Gongde Guo +2 more

In this paper, we discuss in some detail how multiparty quantum key agreement protocols must be carefully designed and present a collusion attack to illustrate this point. Then, a secure circle-type multiparty quantum key agreement with Bell states is proposed. Bell states are used as the information carriers and transmitted among the participants, who embed their secrets into the traveling particles via certain encoding operations. In this way, all participants simultaneously obtain the same agreement key, i.e., the sum of their secret inputs, at the end of the protocol. Here, quantum state discrimination is utilized to design the encoding operations, which ensures that the proposed protocol is correct and secure against the presented collusion attack. Furthermore, it is shown that the proposed protocol satisfies three conditions of a secure quantum key agreement protocol in theory. In addition, these encoding operations consist of some common single-qubit gates, the Hadamard operator and four Pauli operators, which makes the proposed protocol feasible using current technology.

Physical Review A•Oct 25, 2021•42 citations
Multiparty quantum key agreement (MQKA) enables n≥3n \geq 3n≥3 mutually distrustful users to establish a shared secret key through collaborative quantum protocols. In this paper, we provide a comprehensive review where we argue that MQKA is best understood as a design space organized along three orthogonal but tightly coupled axes: (1) network architecture, which determines how quantum states flow between participants; (2) quantum resources, which encode the physical degrees of freedom used for implementation; and (3) security model, which defines trust assumptions about devices and infrastructure. Rather than treating MQKA as a linear sequence of isolated protocols, we develop this three-axis perspective to reveal recurrent patterns, sharp trade-offs, and unexplored design spaces. We classify MQKA protocols into structural families, map them to underlying quantum resources, and analyze how different security models shape fairness and collusion resistance. We further identify open challenges in composable security frameworks, network native integration, device-independent implementations, and propose a research roadmap toward hybrid-resource, bosonic-code-encoded, and fairness-aware MQKA suitable for the future quantum internet deployments in the post-NISQ era.
The fairness of a secure multi-party quantum key agreement (MQKA) protocol requires that all involved parties are entirely peer entities and can equally influence the outcome of the protocol to establish a shared key wherein no one can decide the shared key alone. However, it is found that parts of the existing MQKA protocols are sensitive to collusion attacks, i.e., some of the dishonest participants can collaborate to predetermine the final key without being detected. In this paper, a multi-party QKA protocol resisting collusion attacks is proposed. Different from previous QKA protocol resisting N−1N-1N−1 coconspirators or resisting 111 coconspirators, we investigate the general circle-type MQKA protocol which can be secure against ttt dishonest participants' cooperation. Here, t<Nt < Nt<N. We hope the results of the presented paper will be helpful for further research on fair MQKA protocols.
Abstract Multi-party quantum key agreement (MQKA) enables a group of mutually untrusted users to jointly establish a secret key with equal influence, a capability not provided by two-party quantum key distribution (QKD) and increasingly relevant for securing resilient infrastructure such as quantum-enabled smart grid networks and distributed cyber-physical systems. We present a high-dimensional Greenberger-Horne-Zeilinger (GHZ)-based MQKA that simultaneously targets rigorous security, provable fairness, and practical loss tolerance. The protocol distributes an N -partite d -level GHZ state in a star (with an optional star-of-stars hierarchy for large N ) and maps each user’s contribution to local XdaZdbX_{d}^{a} Z_{d}^{b}Xda​Zdb​ X d a Z d b operations. A commit-then-reveal layer makes inputs binding and hiding, yielding equal influence fairness over Zd\mathbb{Z}_{d}Zd​ Z d with a strict fair-abort guarantee. Composable secrecy is established via entropy bounds and a Devetak-Winter-style key rate analysis, strengthened by test-round statistics; we connect Mermin/Svetlichny-type correlators to min-entropy lower bounds and incorporate full leakage accounting and finite-key penalties. We model depolarizing, shift/phase (Weyl), amplitude-damping, erasures, detector efficiency, and dark counts, and derive closed-form mappings from device parameters to symbol/phase errors. Monte Carlo studies confirm that d>2d>2d>2 d > 2 expands the positive-rate region and reduces the global survival required for a given throughput compared with qubit GHZ MQKA under identical conditions. We discuss potential photonic realizations (time-bin or frequency-bin encoding, discrete Fourier transform networks, and superconducting nanowire detectors) and architectural pathways toward larger N via hierarchical clustering, while acknowledging the significant technological challenges that would need to be overcome to realize high-dimensional multipartite entanglement experimentally. Overall, the scheme delivers higher efficiency per entangled state, rigorous fairness, and composable security with realistic noise and loss, addressing key gaps in current MQKA designs for resilient infrastructure.
Fairness is an important standard needed to be considered in a secure quantum key agreement (QKA) protocol. However, it found that most of the quantum key agreement protocols in the travelling model are not fair, i.e., some of the dishonest participants can collaborate to predetermine the final key without being detected. Thus, how to construct a fair and secure key agreement protocol has obtained much attention. In this paper, a new fair multiparty QKA protocol that can resist the collusive attack is proposed. More specifically, we show that in a client-server scenario, it is possible for the clients to share a key and reveal nothing about what key has been agreed upon to the server. The server prepares quantum states for clients to encode messages to avoid the participants' collusive attack. This construction improves on previous work, which requires either preparing multiple quantum resources by clients or two-way quantum communication. It is proven that the protocol does not reveal to any eavesdropper, including the server, what key has been agreed upon, and the dishonest participants can be prevented from collaborating to predetermine the final key.
As a burgeoning branch of quantum cryptography, quantum key agreement is a kind of key establishing processes where the security and fairness of the established common key should be guaranteed simultaneously. However, the difficulty on designing a qualified quantum key agreement protocol increases significantly with the increase of the number of the involved participants. Thus far, only few of the existing multiparty quantum key agreement (MQKA) protocols can really achieve security and fairness. Nevertheless, these qualified MQKA protocols are either too inefficient or too impractical. In this paper, an MQKA protocol is proposed with single photons in travelling mode. Since only one eavesdropping detection is needed in the proposed protocol, the qubit efficiency and measurement efficiency of it are higher than those of the existing ones in theory. Compared with the protocols which make use of the entangled states or multi-particle measurements, the proposed protocol is more feasible with the current technologies. Security and fairness analysis shows that the proposed protocol is not only immune to the attacks from external eavesdroppers, but also free from the attacks from internal betrayers.
Multiparty quantum key agreement (MQKA) is a significant topic that the shared key must be negotiated equally by all participants. In this paper, we use Bell state as quantum resource and add controlled-not gate to avoid information leakage. There is very little research on the quantum key agreement protocol based on quantum search algorithms. Therefore, we propose a quantum key agreement protocol which is based on Grover’s algorithm as one of the most famous quantum search algorithms. The security analysis appears very promising.
In this paper, we discuss in some detail how multiparty quantum key agreement protocols must be carefully designed and present a collusion attack to illustrate this point. Then, a secure circle-type multiparty quantum key agreement with Bell states is proposed. Bell states are used as the information carriers and transmitted among the participants, who embed their secrets into the traveling particles via certain encoding operations. In this way, all participants simultaneously obtain the same agreement key, i.e., the sum of their secret inputs, at the end of the protocol. Here, quantum state discrimination is utilized to design the encoding operations, which ensures that the proposed protocol is correct and secure against the presented collusion attack. Furthermore, it is shown that the proposed protocol satisfies three conditions of a secure quantum key agreement protocol in theory. In addition, these encoding operations consist of some common single-qubit gates, the Hadamard operator and four Pauli operators, which makes the proposed protocol feasible using current technology.