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:2404.19720

Efficient Multiparty Quantum Key Distribution over Quantum Networks

Samuel Oslovich, Bing Wang, Walter O. Krawec, Kenneth Goodenough

Published Apr 30, 2024• 1 citation
arXivHTMLPDF

Abstract

Multiparty quantum key distribution (QKD) is useful for many applications that involve secure communication or collaboration among multiple parties. While it can be achieved using pairwise QKD, a more efficient approach is to achieve it using multipartite entanglement distributed over quantum networks that connect the multiple parties. Existing studies on multipartite entanglement distribution, however, are not designed for multiparty QKD, and hence do not aim to maximize secret key generation rate. In this paper, we design efficient strategies for multiparty QKD over quantum networks. For 3-party QKD, we derive closed-form expressions for analyzing key distribution over quantum networks. We then use it to develop an efficient strategy for 3-party QKD by packing multiple stars that connect the 3 parties. For the general form of N-party QKD, we develop an approach that packs multiple trees to connect the N parties, while directly incorporating the estimated key rates on network paths. Extensive evaluation of our strategies, in both grid and random graphs, under a wide range of settings, demonstrates that our schemes achieve high key rate, which degrades gracefully when increasing the number of parties.

DOI
10.48550/arxiv.2404.19720

Related papers

Efficient Quantum Conference Key Agreement over Quantum Networks

Samuel Oslovich, Md. Zakir Hossain, Trevor N. Thomas +3 more

Quantum conference key agreement (CKA) is useful for many applications that involve secure communication or collaboration among multiple parties. While CKA over quantum networks can be achieved using pairwise quantum key distribution, a more efficient approach is to establish keys among the parties directly through multipartite entanglement distribution. Existing studies on multipartite entanglement distribution, however, are not designed for CKA, and hence do not aim to optimize key rate. In this paper, we first develop an efficient 3-party CKA strategy based on a closed-form expression that we derive for estimating errors. We then develop a general strategy for N-party CKA that accounts for estimated key rates on individual network paths. For both cases, we use multipath routing to improve key rate. We evaluate our approach in a wide range of settings and demonstrate that it achieves high key rate and degrades gracefully when increasing the number of parties.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•3 citations

Multi-partite entanglement can speed up quantum key distribution in networks

Michael Epping, Hermann Kampermann, Chiara Macchiavello +1 more

The laws of quantum mechanics allow for the distribution of a secret random key between two parties.Here we analyse the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource states with genuine N-partite entanglement.We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates.Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot.It is shown how this advantage leads to a higher secret key rate. Multipartite QKD: protocol and security analysisThe entanglement-based Ekert protocol [7] can be generalised to N parties as follows, see also [31,34].The parties A and B 1 , B 2 , ..., B N 1 -share an N-partite entangled state and perform local projective measurements.The

arXiv:1612.05585•New Journal of Physics•Sep 14, 2017•206 citations

Quantum Network Security: A Multi-Party Computation Protocol Leveraging Quantum Key Distribution and Quantum State Secure Computation

Jincheng Zhang

This paper presents a novel protocol for secure multi-party computation (MPC) within a quantum network, integrating Quantum Key Distribution (QKD) and quantum state secure computation techniques. The core objective is to enable multiple parties to collaboratively perform computations without revealing their individual inputs. The proposed protocol establishes a secure communication channel using QKD, guaranteeing the exchange of secret keys. Subsequently, a quantum state secure multi-party computation algorithm is employed, ensuring the confidentiality and integrity of the computation process. The utilization of quantum key distribution significantly enhances the security of the entire system, mitigating vulnerabilities associated with traditional MPC schemes. The theoretical analysis demonstrates the protocol's resilience against various attacks, providing a foundation for building robust and secure quantum network applications. The protocol's effectiveness hinges on the ability to maintain quantum coherence during the computational steps and accurately manage the quantum key distribution process. This research contributes to the advancement of secure quantum computing and communication technologies.

•Aug 31, 2026•0 citations

Challenges of Routing in Quantum Key Distribution Networks with Trusted Nodes for Key Relaying

Peng‐Yong Kong

Quantum key distribution (QKD) protocols generate a same secret key at two nodes which are at different locations. Such key is used to encrypt and decrypt messages for unconditionally secure communications through a classical channel. Originally, QKD protocols are designed to work between two nodes which are directly connected through a point-to-point quantum channel. Currently, commercial QKD systems have limited range and key rate. To increase key rate and extend range, the key generated by QKD at one end node is relayed hop-by-hop to the other end node through multiple trusted nodes. In a QKD network with multiple pairs of communicating nodes, routing deals with the issue of deciding for each pair, which trusted nodes are used to form a path connecting the end nodes. This paper presents an overview of QKD and highlights the differences between QKD routing as compared to classical routing. The challenges of QKD routing are presented. Existing works dealing with the challenges are surveyed. This paper ends with a discussion on remaining research issues.

IEEE Communications Magazine•Sep 19, 2023•17 citations

Scalable Quantum Key Distribution Protocol

Jincheng Zhang

This paper presents a novel scalable Quantum Key Distribution (QKD) protocol designed to facilitate secure key exchange in large-scale quantum communication systems. The protocol leverages quantum entanglement and quantum measurement techniques to generate and distribute a secret key between multiple parties. A key limitation of existing QKD protocols is their restricted scalability. This proposed protocol addresses this issue through a carefully designed architecture and utilizes advanced quantum information processing concepts to enable the expansion of the system while maintaining its inherent security. The theoretical analysis demonstrates the protocol's feasibility and outlines key parameters for optimization. We focus on the core mechanisms and provide a detailed description of the protocol's operation, highlighting its potential for practical implementation in future quantum networks. The protocol's performance characteristics, including key rate and security level, are discussed.

•Sep 7, 2026•0 citations

Secret Key Rate of Quantum Key Distribution Assuming Worst-Case Attacks

Amelie Sophia Ettinger, Marcel Kokorsch, Guido K.E. Dietl

Quantum Key Distribution (QKD) represents a revolutionary approach in the field of cryptography, offering the potential for unconditional security by leveraging the principles of quantum mechanics. This paper addresses the crucial issue of calculating secure key rates in entanglement based QKD systems. We present a method of key rate calculations that is independent of an eavesdropper's quantum system, relying solely on the quantum states shared between two communicating parties under the assumption of a worst-case attack. We undertake a comparison of asymptotic key rates with those observed in the finite regime, in which only a limited number of quantum states are exchanged. Furthermore, we investigate the influence of entanglement distillation on the achievable key rates. By identifying the numerically optimal number of entanglement distillation iterations based on the initial fidelity and the number of exchanged quantum states, we demonstrate how to achieve a balance between the quantity and quality of entangled states, thereby maximizing the secure key rate. Our results show that there is a unique optimum within a defined search range. Moreover, we determine the minimum number of exchanged quantum states necessary to attain a positive key rate and to obtain a desired number of secure key bits, which are both contingent upon the quality of the communication channel. It is anticipated that the insights gained from this work will prove instrumental in the development of optimal routing strategies in quantum communication networks.

International ITG Conference on Systems, Communications and Coding (SCC)•Mar 10, 2025•3 citations
Multiparty quantum key distribution (QKD) is useful for many applications that involve secure communication or collaboration among multiple parties. While it can be achieved using pairwise QKD, a more efficient approach is to achieve it using multipartite entanglement distributed over quantum networks that connect the multiple parties. Existing studies on multipartite entanglement distribution, however, are not designed for multiparty QKD, and hence do not aim to maximize secret key generation rate. In this paper, we design efficient strategies for multiparty QKD over quantum networks. For 3-party QKD, we derive closed-form expressions for analyzing key distribution over quantum networks. We then use it to develop an efficient strategy for 3-party QKD by packing multiple stars that connect the 3 parties. For the general form of N-party QKD, we develop an approach that packs multiple trees to connect the N parties, while directly incorporating the estimated key rates on network paths. Extensive evaluation of our strategies, in both grid and random graphs, under a wide range of settings, demonstrates that our schemes achieve high key rate, which degrades gracefully when increasing the number of parties.
Quantum conference key agreement (CKA) is useful for many applications that involve secure communication or collaboration among multiple parties. While CKA over quantum networks can be achieved using pairwise quantum key distribution, a more efficient approach is to establish keys among the parties directly through multipartite entanglement distribution. Existing studies on multipartite entanglement distribution, however, are not designed for CKA, and hence do not aim to optimize key rate. In this paper, we first develop an efficient 3-party CKA strategy based on a closed-form expression that we derive for estimating errors. We then develop a general strategy for N-party CKA that accounts for estimated key rates on individual network paths. For both cases, we use multipath routing to improve key rate. We evaluate our approach in a wide range of settings and demonstrate that it achieves high key rate and degrades gracefully when increasing the number of parties.
The laws of quantum mechanics allow for the distribution of a secret random key between two parties.Here we analyse the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource states with genuine N-partite entanglement.We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates.Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot.It is shown how this advantage leads to a higher secret key rate. Multipartite QKD: protocol and security analysisThe entanglement-based Ekert protocol [7] can be generalised to N parties as follows, see also [31,34].The parties A and B 1 , B 2 , ..., B N 1 -share an N-partite entangled state and perform local projective measurements.The
This paper presents a novel protocol for secure multi-party computation (MPC) within a quantum network, integrating Quantum Key Distribution (QKD) and quantum state secure computation techniques. The core objective is to enable multiple parties to collaboratively perform computations without revealing their individual inputs. The proposed protocol establishes a secure communication channel using QKD, guaranteeing the exchange of secret keys. Subsequently, a quantum state secure multi-party computation algorithm is employed, ensuring the confidentiality and integrity of the computation process. The utilization of quantum key distribution significantly enhances the security of the entire system, mitigating vulnerabilities associated with traditional MPC schemes. The theoretical analysis demonstrates the protocol's resilience against various attacks, providing a foundation for building robust and secure quantum network applications. The protocol's effectiveness hinges on the ability to maintain quantum coherence during the computational steps and accurately manage the quantum key distribution process. This research contributes to the advancement of secure quantum computing and communication technologies.
Quantum key distribution (QKD) protocols generate a same secret key at two nodes which are at different locations. Such key is used to encrypt and decrypt messages for unconditionally secure communications through a classical channel. Originally, QKD protocols are designed to work between two nodes which are directly connected through a point-to-point quantum channel. Currently, commercial QKD systems have limited range and key rate. To increase key rate and extend range, the key generated by QKD at one end node is relayed hop-by-hop to the other end node through multiple trusted nodes. In a QKD network with multiple pairs of communicating nodes, routing deals with the issue of deciding for each pair, which trusted nodes are used to form a path connecting the end nodes. This paper presents an overview of QKD and highlights the differences between QKD routing as compared to classical routing. The challenges of QKD routing are presented. Existing works dealing with the challenges are surveyed. This paper ends with a discussion on remaining research issues.
This paper presents a novel scalable Quantum Key Distribution (QKD) protocol designed to facilitate secure key exchange in large-scale quantum communication systems. The protocol leverages quantum entanglement and quantum measurement techniques to generate and distribute a secret key between multiple parties. A key limitation of existing QKD protocols is their restricted scalability. This proposed protocol addresses this issue through a carefully designed architecture and utilizes advanced quantum information processing concepts to enable the expansion of the system while maintaining its inherent security. The theoretical analysis demonstrates the protocol's feasibility and outlines key parameters for optimization. We focus on the core mechanisms and provide a detailed description of the protocol's operation, highlighting its potential for practical implementation in future quantum networks. The protocol's performance characteristics, including key rate and security level, are discussed.
Quantum Key Distribution (QKD) represents a revolutionary approach in the field of cryptography, offering the potential for unconditional security by leveraging the principles of quantum mechanics. This paper addresses the crucial issue of calculating secure key rates in entanglement based QKD systems. We present a method of key rate calculations that is independent of an eavesdropper's quantum system, relying solely on the quantum states shared between two communicating parties under the assumption of a worst-case attack. We undertake a comparison of asymptotic key rates with those observed in the finite regime, in which only a limited number of quantum states are exchanged. Furthermore, we investigate the influence of entanglement distillation on the achievable key rates. By identifying the numerically optimal number of entanglement distillation iterations based on the initial fidelity and the number of exchanged quantum states, we demonstrate how to achieve a balance between the quantity and quality of entangled states, thereby maximizing the secure key rate. Our results show that there is a unique optimum within a defined search range. Moreover, we determine the minimum number of exchanged quantum states necessary to attain a positive key rate and to obtain a desired number of secure key bits, which are both contingent upon the quality of the communication channel. It is anticipated that the insights gained from this work will prove instrumental in the development of optimal routing strategies in quantum communication networks.