Routing algorithm within the multiple non-overlapping paths approach for quantum key distribution networks

• URL: http://arxiv.org/abs/2411.07810v1
• Date: Tue, 12 Nov 2024 14:04:31 GMT
• Title: Routing algorithm within the multiple non-overlapping paths approach for quantum key distribution networks
• Authors: Evgeniy O. Kiktenko, Andrey Tayduganov, Aleksey K. Fedorov,
• Abstract summary: We develop a novel key routing algorithm for quantum key distribution (QKD) networks. We present the results of testing the algorithm on two QKD network models consisting of 6 and 10 nodes.
• Score: 0.70224924046445
• License:
• Abstract: We develop a novel key routing algorithm for quantum key distribution (QKD) networks that utilizes a distribution of keys between remote, i.e., not directly connected by a QKD link, nodes through multiple non-overlapping paths. This approach enchases the security of 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.

Related papers

• Distributed Information-theoretical Secure Protocols for Quantum Key Distribution Networks against Malicious Nodes [15.200383830307915]
  Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Current research on QKD networks primarily addresses passive attacks conducted by malicious nodes such as eavesdropping. We suggest a novel paradigm, inspired by distributed systems, to address the active attack by collaborate malicious nodes in QKD networks.
  arXiv  Detail & Related papers  (2023-02-14T11:53:22Z)
• Dynamic Routing for Quantum Key Distribution Networks [2.913123182364138]
  In this paper, we consider quantum key distribution (QKD) in a quantum network with both quantum repeaters and a small number of trusted nodes. We develop a new dynamic routing strategy that makes routing decisions based on the current network state, as well as evaluate various classical/quantum post-processing techniques.
  arXiv  Detail & Related papers  (2022-12-06T17:17:12Z)
• Bandwidth-efficient distributed neural network architectures with application to body sensor networks [73.02174868813475]
  This paper describes a conceptual design methodology to design distributed neural network architectures. We show that the proposed framework enables up to a factor 20 in bandwidth reduction with minimal loss. While the application focus of this paper is on wearable brain-computer interfaces, the proposed methodology can be applied in other sensor network-like applications as well.
  arXiv  Detail & Related papers  (2022-10-14T12:35:32Z)
• Robust Training and Verification of Implicit Neural Networks: A Non-Euclidean Contractive Approach [64.23331120621118]
  This paper proposes a theoretical and computational framework for training and robustness verification of implicit neural networks. We introduce a related embedded network and show that the embedded network can be used to provide an $ell_infty$-norm box over-approximation of the reachable sets of the original network. We apply our algorithms to train implicit neural networks on the MNIST dataset and compare the robustness of our models with the models trained via existing approaches in the literature.
  arXiv  Detail & Related papers  (2022-08-08T03:13:24Z)
• An Efficient Routing Protocol for Quantum Key Distribution Networks [9.203625000707856]
  Quantum key distribution (QKD) can provide point-to-point information-theoretic secure key services for two connected users. QOLSR considerably improves quantum key utilization in QKD networks through link-state awareness and path optimization.
  arXiv  Detail & Related papers  (2022-04-29T07:37:45Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Fast and Secure Routing Algorithms for Quantum Key Distribution Networks [5.659290426197763]
  We consider the problem of secure packet routing at the maximum achievable rate in Quantum Key Distribution (QKD) networks. We propose a new secure throughput-optimal policy called Tandem Queue Decomposition (TQD) We show that the TQD policy solves the problem of secure and efficient packet routing for a broad class of traffic, including unicast, broadcast, multicast, and anycast.
  arXiv  Detail & Related papers  (2021-09-16T12:29:41Z)
• Optimizing the deployment of quantum key distribution switch-based networks [0.4643589635376553]
  We present a QKD network architecture that provides a significant reduction in the cost of deploying QKD networks by using optical switches. We demonstrate that the switch-based architecture allows achieving significant resource savings of up to 28%, while the throughput is reduced by 8% only.
  arXiv  Detail & Related papers  (2021-04-09T04:13:04Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• NOMA in UAV-aided cellular offloading: A machine learning approach [59.32570888309133]
  A novel framework is proposed for cellular offloading with the aid of multiple unmanned aerial vehicles (UAVs) Non-orthogonal multiple access (NOMA) technique is employed at each UAV to further improve the spectrum efficiency of the wireless network. A mutual deep Q-network (MDQN) algorithm is proposed to jointly determine the optimal 3D trajectory and power allocation of UAVs.
  arXiv  Detail & Related papers  (2020-10-18T17:38:48Z)
• ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
  We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks. Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
  arXiv  Detail & Related papers  (2020-06-28T23:09:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.