Corpus ID: 237532464

Fast and Secure Routing Algorithms for Quantum Key Distribution Networks

  title={Fast and Secure Routing Algorithms for Quantum Key Distribution Networks},
  author={B. A. Vishnu and Abhishek Sinha},
  • B. Vishnu, Abhishek Sinha
  • Published 16 September 2021
  • Computer Science, Physics
  • ArXiv
This paper considers the problem of secure packet routing at the maximum achievable rate in a Quantum key distribution (QKD) network. Assume that a QKD protocol generates symmetric private keys for secure communication over each link in a multi-hop network. The quantum key generation process, which is affected by noise, is assumed to be modeled by a stochastic counting process. Packets are first encrypted with the available quantum keys for each hop and then transmitted on a point-to-point… 

Figures from this paper


Security assessment and key management in a quantum network
The classical network theory and graph theory is utilized to establish a framework for a quantum network, addressing two critical issues, security and key management, and can be a standard approach for future quantum network designs.
Quantum-Safe Metro Network With Low-Latency Reconfigurable Quantum Key Distribution
A practical quantum-safe metro network, integrating optically-switched QKD systems with high speed reconfigurability to protect classical network traffic and efficient quantum encryption topologies between different end-users is presented.
Unconditional security of quantum key distribution over arbitrarily long distances
  • Lo, Châu
  • Computer Science, Medicine
  • 1999
The problem is solved by showing that, given fault-tolerant quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure.
Simple proof of security of the BB84 quantum key distribution protocol
  • Shor, Preskill
  • Computer Science, Medicine
    Physical review letters
  • 2000
We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. We first give a key distribution protocol based on entanglement purification, which can be
Post-quantum cryptography
The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.
Long-term performance of the SwissQuantum quantum key distribution network in a field environment
In this paper, we report on the performance of the SwissQuantum quantum key distribution (QKD) network. The network was installed in the Geneva metropolitan area and ran for more than one-and-a-half
Building the quantum network
We show how quantum key distribution (QKD) techniques can be employed within realistic, highly secure communications systems, using the internet architecture for a specific example. We also discuss
Optimal Control for Generalized Network-Flow Problems
The proof of throughput-optimality of the UMW policy combines ideas from the stochastic Lyapunov theory with a sample path argument from adversarial queueing theory and may be of independent theoretical interest.
Quantum Networking
  • R. V. Meter
  • Computer Science
    Cryptography Apocalypse
  • 2019
Long-distance entanglement can be used to execute important tasks such as Byzantine agreement and leader election in fewer rounds of communication than classical systems, improving the efficiency of operations that are critical in distributed systems.
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
A simple and checkable network flow-type load condition is formulated for adaptive adversarial queueing networks, and a policy is proposed which achieves stability under this new load condition.