Fast and Secure Routing Algorithms for Quantum Key Distribution Networks

• URL: http://arxiv.org/abs/2109.07934v2
• Date: Fri, 27 May 2022 06:30:23 GMT
• Title: Fast and Secure Routing Algorithms for Quantum Key Distribution Networks
• Authors: Shahbaz Akhtar, Krishnakumar G, Vishnu B, and Abhishek Sinha
• Abstract summary: 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.
• Score: 5.659290426197763
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We consider the problem of secure packet routing at the maximum achievable rate in Quantum Key Distribution (QKD) networks. Assume that a QKD protocol generates symmetric private key pairs for secure communication over each link in a network. The quantum key generation process is modeled using a stochastic counting process. Packets are first encrypted with the quantum keys available for each hop and then transmitted on a point-to-point basis over the links. A fundamental problem in this setting is the design of a secure and capacity-achieving routing policy that takes into account the time-varying availability of the encryption keys and finite link capacities. In this paper, we propose a new secure throughput-optimal policy called Tandem Queue Decomposition (TQD). The TQD policy is derived by combining the QKD process with the Universal Max Weight routing policy, proposed earlier by Sinha and Modiano. 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. The proposed decomposition reduces the problem to the generalized network flow problem without the key availability constraints over a transformed network. The proof of the throughput-optimality of the TQD policy uses the Lyapunov stability theory for analyzing the interdependent packet queueing process and the key-storage dynamics. Finally, we demonstrate the competitiveness of the TQD policy over the existing algorithms by numerically comparing them on a simulator that we build on top of the state-of-the-art OMNeT++ network simulator platform.

Related papers

• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Differentially Private Deep Q-Learning for Pattern Privacy Preservation in MEC Offloading [76.0572817182483]
  attackers may eavesdrop on the offloading decisions to infer the edge server's (ES's) queue information and users' usage patterns. We propose an offloading strategy which jointly minimizes the latency, ES's energy consumption, and task dropping rate, while preserving pattern privacy (PP) We develop a Differential Privacy Deep Q-learning based Offloading (DP-DQO) algorithm to solve this problem while addressing the PP issue by injecting noise into the generated offloading decisions.
  arXiv  Detail & Related papers  (2023-02-09T12:50:18Z)
• Optimization of QKD Networks with Classical and Quantum Annealing [0.7827586118586438]
  Quantum Key Distribution (QKD) hardware is used in a tier 1 provider network. The ensemble of QKD systems needs to be able to exchange as many encryption keys. Redundancy and latency requirements add additional boundary conditions.
  arXiv  Detail & Related papers  (2022-06-28T16:08:12Z)
• Analysis of Multiple Overlapping Paths algorithms for Secure Key Exchange in Large-Scale Quantum Networks [0.0]
  Current implementations of quantum networks are unavoidably equipped with trusted nodes. Some new authentication and key exchange schemes must be considered to fully benefit from the unconditional security of links. One such approach uses Multiple Non-Overlapping Paths (MNOPs) for key exchange to mitigate the risk of an attack on a trusted node.
  arXiv  Detail & Related papers  (2022-05-06T12:40:52Z)
• An Information-theoretical Secured Byzantine-fault Tolerance Consensus in Quantum Key Distribution Network [13.007691543559666]
  Quantum key distribution (QKD) networks are expected to provide information-theoretical secured (ITS) communication over long distances. We propose an ITS Byzantine-fault tolerance (BFT) QKD network scheme to achieve end-to-end key distribution based on point-to-point QKD links. We theoretically analyze proposed ITSBFT-QKD network scheme from four aspects: QKD key distribution security, temporary signature security, consensus security, and leader election fairness.
  arXiv  Detail & Related papers  (2022-04-21T01:04:39Z)
• 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)
• The QQUIC Transport Protocol: Quantum assisted UDP Internet Connections [11.223026257748657]
  Quantum key distribution, in 1984, is a commercialized secure communication method which enables two parties to produce shared random secret key by the nature of quantum mechanics. We propose QQUIC (Quantum assisted Quick Internet Connections) transport protocol, which modifies the famous QUIC transport protocol by employing the quantum key distribution instead of the original classical algorithms in the key exchanging stage.
  arXiv  Detail & Related papers  (2020-06-01T00:44:58Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

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.