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

Multi-path Security in Quantum Networks with Trusted Nodes

Muhammad Kumail Haider, Aeysha Khalique

quant-phSubmitted Oct 19, 2026• Announced Oct 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum communication networks promise information-theoretic security but this security collapses if intermediate relay nodes are compromised, a risk that grows sharply when compromised nodes cannot be identified. We address this twofold: first, we show that multi-path routing provides quantifiable protection against unidentified compromised nodes. Second, we provide a comprehensive statistical and graph-theoretic analysis of network and node security under compromise, covering full and partial node compromise, optimal placement of additional edges via an iterative method, and comparative hacking-probability analysis across network topologies. Together, these results identify the topology and multi-path routing strategy that most improves security for a given network. We apply this framework to quantum key distribution across multiple network topologies, demonstrating a scalable route to secure, reliable quantum communication under realistic, unidentified adversarial threats, without relying on quantum memory.

AI Summary

The paper studies how multipath routing can protect trusted-relay QKD networks when compromised intermediate nodes cannot be identified. It assumes secure endpoints and combines independently distributed path keys by XOR, so the final key remains secret whenever at least one constituent path is uncompromised. For independently compromised nodes with security probabilities $p_v$, a path has security probability $P_{\mathrm{path}}=\prod_v p_v$. For internally vertex-disjoint paths, the model gives $P_{\mathrm{net}}=1-\prod_i(1-P_{\mathrm{path},i})$. Routing uses negative-logarithmic node weights and repeated shortest-path searches, deleting previously used intermediate nodes; the stated runtime is $O(T|V|^2)$ for $T$ paths. A separate construction enumerates all $\binom{|V|-2}{T}$ possible sets of compromised nodes and collects paths avoiding each set, providing protection against up to $T$ compromises when every set admits an avoiding path. Numerical comparisons cover seven ten-node topologies: line, star, cycle, grid, tree, wheel, and connected tree. They evaluate security versus node-compromise probability, enumerate fixed-size compromise sets to calculate pairwise hacking probabilities, and search candidate additional edges for improvements in network-average security. Multipath gains appear in topologies supporting redundant routes, whereas line, star, and tree networks show no such gains. The QKD application models the final rate as $R_{\mathrm{final}}=P_{\mathrm{net}}\min_i R_{\mathrm{path},i}$ and reports increased modeled rates with additional paths. The stated computational limitation is the combinatorial growth of the compromise-enumeration construction. The probabilistic analysis assumes independent node compromises; its topology comparisons use ten-node networks.

Likely largely AI-generatedIncrementalSmall numerics onlyOverclaimsPossible error

Central claim may not hold: GreedyPaths() can destroy the possibility of finding two internally disjoint paths even when they exist, contradicting its claimed feasibility and security optimality. The exhaustive compromise-set and simple-path analyses have exponential worst-case scaling, so the ten-node demonstrations do not establish the advertised general scalability. The statistical formula correctly gives the probability that at least one path is secure under its stated assumptions, but the accompanying sentence incorrectly calls it the probability that all paths are secure. The conclusion's endpoint-degree condition for guaranteed security is false because a smaller internal vertex cut can compromise every route. The proposed final key rate multiplies throughput by a probability of secrecy without establishing that the resulting output satisfies a cryptographic secrecy criterion.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
20 pages

Related papers

A Multi-Path QKD Algorithm with Multiple Segments

Liu Cheng, Xuanxuan Che, Jianshe Xie +1 more

Quantum Key Distribution (QKD) provides unconditional peer-to-peer security based on the principles of quantum physics. By utilizing relay nodes, the security of QKD can be extended over longer distances. However, the introduction of relay nodes brings both security and communication success rates issues. To tackle those issues we propose an enhanced multi-path scheme. The key features of our proposal are as follows: 1. By taking the reliability of relay nodes as one of the algorithm inputs,making the scheme more suitable for partially trusted QKD (PTQKD) networks. 2. By using Multi-Segment Multi-Path approach increases the difficulty for attackers to obtain complete key information and improves the security of PTQKD. 3. The adaptive routing algorithm generates a sufficient number of diverse paths based on node contribution rate, key freshness, and reliability. We conducted a theoretical analysis of the algorithm,and simulation results on PTQKD demonstrate that our method outperforms traditional QKD methods in terms of security and transmission success rate. This advancement has the potential to enhance the adoption of QKD networks.

Journal of Cyber Security and Mobility•Feb 12, 2024•9 citations

An Ultimate Benchmark for the Optimal Performance of Quantum Communication Network Using Multi Path Routing Protocol

Jatin Khurana

In recent years, quantum communication networks have emerged as a promising alternative to classical communication networks for the transmission of quantum information. One of the challenges for achieving optimal performance in quantum communication networks is the efficient routing of quantum signals across multiple paths. To address this, a variety of routing protocols have been proposed, including multi-path routing protocols. Multi-path routing involves sending a quantum signal through multiple distinct paths simultaneously to reduce delays in the transmission of quantum information. By distributing the quantum information over multiple paths, this approach can provide significant performance improvements, including reduced latency and higher throughput. In addition, multi-path routing can enable new possibilities for the security of quantum communication networks, such as more secure entanglement swapping protocols and improved protection against eavesdropping. In this paper, we investigate the performance of multi-path routing protocols in multi-node quantum communication networks. We consider two approaches to multi-path routing, a basic routing approach based on shortest path optimization, and a more advanced approach based on graph partitions. We evaluate the performance of these protocols in a range of multi-node networks, with focus on the trade-off between latency and throughput. The results show that multi-path routing yields significant performance improvements in such networks and provides an efficient way for routing quantum signals across multiple paths.

World Conference on Communication & Computing (WCONF)•Jul 14, 2023•0 citations

Trust-Aware Causal Consistency Routing for Quantum Key Distribution Networks Against Malicious Nodes

Yi Luo, Qiong Li

Quantum key distribution (QKD) networks promise information-theoretic security for multiple nodes by leveraging the fundamental laws of quantum mechanics. In practice, QKD networks require dedicated routing protocols to coordinate secure key distribution among distributed nodes. However, most existing routing protocols operate under the assumption that all relay nodes are honest and fully trustworthy, an assumption that may not hold in realistic scenarios. Malicious nodes may tamper with routing updates, causing inconsistent key-state views or divergent routing plans across the network. Such inconsistencies increase routing failure rates and lead to severe wastage of valuable secret keys. To address these challenges, we propose a distributed routing framework that combines two key components: (i) Causal Consistency Key-State Update, which prevents malicious nodes from propagating inconsistent key states and routing plans; and (ii) Trust-Aware Multi-path Flow Optimization, which incorporates trust metrics derived from discrepancies in reported states into the path-selection objective, penalizing suspicious links and filtering fabricated demands. Across 50-node topologies with up to 30% malicious relays and under all three attack modes, our protocol sustains a high demand completion ratio (DCR) (mean 0.90, range 0.81-0.98) while keeping key utilization low (16.6 keys per demand), decisively outperforming the baselines-Multi-Path Planned (DCR 0.48, 30.8 keys per demand) and OSPF (DCR ≤0.12, 296 keys per demand; max 1601). These results highlight that our framework balances reliability and efficiency, providing a practical and resilient foundation for secure QKD networking in adversarial environments.

Entropy•Oct 24, 2025•3 citations

Secure Key Relaying in Quantum Key Distribution Networks with Malicious Relay Nodes

Zarna Dinesh Solanki, Aayush Jain, Adwait A. Gondhalekar +3 more

Abstract Secure key distribution is crucial for maintaining communication confidentiality in networks with multiple communicating partners. Asymmetric key algorithms are vulnerable to quantum attacks because of the computational advantage offered by quantum computers, whereas symmetric key algorithms with sufficiently large keys remain comparatively more resistant. Quantum Key Distribution (QKD) has emerged as a promising quantum-secure key distribution technique based on the principles of quantum physics. However, practical QKD networks often rely on relay nodes to extend communication distance, and malicious relay nodes can compromise quantum keys during the relaying process. This study proposes a secure key relaying approach based on Shamir's Secret Sharing to mitigate this vulnerability. The proposed method uses a probabilistic behavioural model to assess relay nodes according to their curiosity and collaboration tendencies. By splitting a quantum key into multiple shares and routing them through paths with minimum compromise risk, the approach reduces exposure to malicious or colluding relay nodes. The proposed algorithm assigns risk to network paths by evaluating node-level curiosity and collaboration potential, determines the appropriate number of shares, and selects secure routing paths to minimise key compromise. The study further analyses the parameters influencing the ideal number of shares for a given network, thereby offering a resilient mechanism for quantum-safe communication in QKD networks with malicious relay nodes.

•Oct 15, 2026•0 citations

Routing Algorithm Within the Multiple Non-Overlapping Paths’ Approach for Quantum Key Distribution Networks

Evgeniy O. Kiktenko, A. Tayduganov, Aleksey K. Fedorov

We develop a novel key routing algorithm for quantum key distribution (QKD) networks that utilizes a distribution of keys between remote nodes, i.e., not directly connected by a QKD link, through multiple non-overlapping paths. This approach focuses on the security of a QKD network by minimizing potential vulnerabilities associated with individual trusted nodes. The algorithm ensures a balanced allocation of the workload across the QKD network links, while aiming for the target key generation rate between directly connected and remote nodes. We present the results of testing the algorithm on two QKD network models consisting of 6 and 10 nodes. The testing demonstrates the ability of the algorithm to distribute secure keys among the nodes of the network in an all-to-all manner, ensuring that the information-theoretic security of the keys between remote nodes is maintained even when one of the trusted nodes is compromised. These results highlight the potential of the algorithm to improve the performance of QKD networks.

arXiv:2411.07810•Entropy•Dec 16, 2024•10 citations

Routing With Minimum Activated Trusted Nodes in Quantum Key Distribution Networks for Secure Communications

Peng‐Yong Kong

Cyber–physical systems rely heavily on communication networks for remote monitoring and control. It is crucial to protect the communication networks from cyberattacks because an attack on the physical subsystem can be indirectly launched from a compromised cyber subsystem. Since remote control devices have limited computational power, we ensure communication confidentiality and integrity using one-time-pad (OTP) symmetric cryptography, which despite simple is unconditionally secure. To provide OTP with secret keys, we use quantum key distribution (QKD) across multiple hops, where each intermediate relay is a trusted node. These nodes can be weak points in cyberattacks. Hence, this article focuses on routing in multihop QKD networks that reduces the required number of trusted nodes. We formulate and solve an optimization problem to find the set of QKD routes that minimizes the number of activated trusted nodes while satisfying the secret key rate requirements of multiple communicating pairs. Extensive evaluation results confirm that the proposed scheme can indeed has fewer activated trusted nodes as compared to a benchmark scheme that finds only the shortest paths for communicating pairs.

IEEE Internet of Things Journal•Jan 3, 2024•11 citations
Quantum communication networks promise information-theoretic security but this security collapses if intermediate relay nodes are compromised, a risk that grows sharply when compromised nodes cannot be identified. We address this twofold: first, we show that multi-path routing provides quantifiable protection against unidentified compromised nodes. Second, we provide a comprehensive statistical and graph-theoretic analysis of network and node security under compromise, covering full and partial node compromise, optimal placement of additional edges via an iterative method, and comparative hacking-probability analysis across network topologies. Together, these results identify the topology and multi-path routing strategy that most improves security for a given network. We apply this framework to quantum key distribution across multiple network topologies, demonstrating a scalable route to secure, reliable quantum communication under realistic, unidentified adversarial threats, without relying on quantum memory.
The paper studies how multipath routing can protect trusted-relay QKD networks when compromised intermediate nodes cannot be identified. It assumes secure endpoints and combines independently distributed path keys by XOR, so the final key remains secret whenever at least one constituent path is uncompromised.
For independently compromised nodes with security probabilities pvp_vpv​, a path has security probability Ppath=∏vpvP_{\mathrm{path}}=\prod_v p_vPpath​=∏v​pv​. For internally vertex-disjoint paths, the model gives Pnet=1−∏i(1−Ppath,i)P_{\mathrm{net}}=1-\prod_i(1-P_{\mathrm{path},i})Pnet​=1−∏i​(1−Ppath,i​). Routing uses negative-logarithmic node weights and repeated shortest-path searches, deleting previously used intermediate nodes; the stated runtime is O(T∣V∣2)O(T|V|^2)O(T∣V∣2) for TTT paths. A separate construction enumerates all (∣V∣−2T)\binom{|V|-2}{T}(T∣V∣−2​) possible sets of compromised nodes and collects paths avoiding each set, providing protection against up to TTT compromises when every set admits an avoiding path.
Numerical comparisons cover seven ten-node topologies: line, star, cycle, grid, tree, wheel, and connected tree. They evaluate security versus node-compromise probability, enumerate fixed-size compromise sets to calculate pairwise hacking probabilities, and search candidate additional edges for improvements in network-average security. Multipath gains appear in topologies supporting redundant routes, whereas line, star, and tree networks show no such gains.
The QKD application models the final rate as Rfinal=Pnetmin⁡iRpath,iR_{\mathrm{final}}=P_{\mathrm{net}}\min_i R_{\mathrm{path},i}Rfinal​=Pnet​mini​Rpath,i​ and reports increased modeled rates with additional paths. The stated computational limitation is the combinatorial growth of the compromise-enumeration construction. The probabilistic analysis assumes independent node compromises; its topology comparisons use ten-node networks.
Quantum Key Distribution (QKD) provides unconditional peer-to-peer security based on the principles of quantum physics. By utilizing relay nodes, the security of QKD can be extended over longer distances. However, the introduction of relay nodes brings both security and communication success rates issues. To tackle those issues we propose an enhanced multi-path scheme. The key features of our proposal are as follows: 1. By taking the reliability of relay nodes as one of the algorithm inputs,making the scheme more suitable for partially trusted QKD (PTQKD) networks. 2. By using Multi-Segment Multi-Path approach increases the difficulty for attackers to obtain complete key information and improves the security of PTQKD. 3. The adaptive routing algorithm generates a sufficient number of diverse paths based on node contribution rate, key freshness, and reliability. We conducted a theoretical analysis of the algorithm,and simulation results on PTQKD demonstrate that our method outperforms traditional QKD methods in terms of security and transmission success rate. This advancement has the potential to enhance the adoption of QKD networks.
In recent years, quantum communication networks have emerged as a promising alternative to classical communication networks for the transmission of quantum information. One of the challenges for achieving optimal performance in quantum communication networks is the efficient routing of quantum signals across multiple paths. To address this, a variety of routing protocols have been proposed, including multi-path routing protocols. Multi-path routing involves sending a quantum signal through multiple distinct paths simultaneously to reduce delays in the transmission of quantum information. By distributing the quantum information over multiple paths, this approach can provide significant performance improvements, including reduced latency and higher throughput. In addition, multi-path routing can enable new possibilities for the security of quantum communication networks, such as more secure entanglement swapping protocols and improved protection against eavesdropping. In this paper, we investigate the performance of multi-path routing protocols in multi-node quantum communication networks. We consider two approaches to multi-path routing, a basic routing approach based on shortest path optimization, and a more advanced approach based on graph partitions. We evaluate the performance of these protocols in a range of multi-node networks, with focus on the trade-off between latency and throughput. The results show that multi-path routing yields significant performance improvements in such networks and provides an efficient way for routing quantum signals across multiple paths.
Quantum key distribution (QKD) networks promise information-theoretic security for multiple nodes by leveraging the fundamental laws of quantum mechanics. In practice, QKD networks require dedicated routing protocols to coordinate secure key distribution among distributed nodes. However, most existing routing protocols operate under the assumption that all relay nodes are honest and fully trustworthy, an assumption that may not hold in realistic scenarios. Malicious nodes may tamper with routing updates, causing inconsistent key-state views or divergent routing plans across the network. Such inconsistencies increase routing failure rates and lead to severe wastage of valuable secret keys. To address these challenges, we propose a distributed routing framework that combines two key components: (i) Causal Consistency Key-State Update, which prevents malicious nodes from propagating inconsistent key states and routing plans; and (ii) Trust-Aware Multi-path Flow Optimization, which incorporates trust metrics derived from discrepancies in reported states into the path-selection objective, penalizing suspicious links and filtering fabricated demands. Across 50-node topologies with up to 30% malicious relays and under all three attack modes, our protocol sustains a high demand completion ratio (DCR) (mean 0.90, range 0.81-0.98) while keeping key utilization low (16.6 keys per demand), decisively outperforming the baselines-Multi-Path Planned (DCR 0.48, 30.8 keys per demand) and OSPF (DCR ≤0.12, 296 keys per demand; max 1601). These results highlight that our framework balances reliability and efficiency, providing a practical and resilient foundation for secure QKD networking in adversarial environments.
Abstract Secure key distribution is crucial for maintaining communication confidentiality in networks with multiple communicating partners. Asymmetric key algorithms are vulnerable to quantum attacks because of the computational advantage offered by quantum computers, whereas symmetric key algorithms with sufficiently large keys remain comparatively more resistant. Quantum Key Distribution (QKD) has emerged as a promising quantum-secure key distribution technique based on the principles of quantum physics. However, practical QKD networks often rely on relay nodes to extend communication distance, and malicious relay nodes can compromise quantum keys during the relaying process. This study proposes a secure key relaying approach based on Shamir's Secret Sharing to mitigate this vulnerability. The proposed method uses a probabilistic behavioural model to assess relay nodes according to their curiosity and collaboration tendencies. By splitting a quantum key into multiple shares and routing them through paths with minimum compromise risk, the approach reduces exposure to malicious or colluding relay nodes. The proposed algorithm assigns risk to network paths by evaluating node-level curiosity and collaboration potential, determines the appropriate number of shares, and selects secure routing paths to minimise key compromise. The study further analyses the parameters influencing the ideal number of shares for a given network, thereby offering a resilient mechanism for quantum-safe communication in QKD networks with malicious relay nodes.
We develop a novel key routing algorithm for quantum key distribution (QKD) networks that utilizes a distribution of keys between remote nodes, i.e., not directly connected by a QKD link, through multiple non-overlapping paths. This approach focuses on the security of a QKD network by minimizing potential vulnerabilities associated with individual trusted nodes. The algorithm ensures a balanced allocation of the workload across the QKD network links, while aiming for the target key generation rate between directly connected and remote nodes. We present the results of testing the algorithm on two QKD network models consisting of 6 and 10 nodes. The testing demonstrates the ability of the algorithm to distribute secure keys among the nodes of the network in an all-to-all manner, ensuring that the information-theoretic security of the keys between remote nodes is maintained even when one of the trusted nodes is compromised. These results highlight the potential of the algorithm to improve the performance of QKD networks.
Cyber–physical systems rely heavily on communication networks for remote monitoring and control. It is crucial to protect the communication networks from cyberattacks because an attack on the physical subsystem can be indirectly launched from a compromised cyber subsystem. Since remote control devices have limited computational power, we ensure communication confidentiality and integrity using one-time-pad (OTP) symmetric cryptography, which despite simple is unconditionally secure. To provide OTP with secret keys, we use quantum key distribution (QKD) across multiple hops, where each intermediate relay is a trusted node. These nodes can be weak points in cyberattacks. Hence, this article focuses on routing in multihop QKD networks that reduces the required number of trusted nodes. We formulate and solve an optimization problem to find the set of QKD routes that minimizes the number of activated trusted nodes while satisfying the secret key rate requirements of multiple communicating pairs. Extensive evaluation results confirm that the proposed scheme can indeed has fewer activated trusted nodes as compared to a benchmark scheme that finds only the shortest paths for communicating pairs.