Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network

Abstract

We introduce a simple, practical approach with probabilistic information-theoretic security to mitigate one of quantum key distribution's major limitations: the short maximum transmission distance (~200 km) possible with present day technology. Our scheme uses classical secret sharing techniques to allow secure transmission over long distances through a network containing randomly-distributed compromised nodes. The protocol provides arbitrarily high confidence in the security of the protocol, with modest scaling of resource costs with improvement of the security parameter. Although some types of failure are undetectable, users can take preemptive measures to make the probability of such failures arbitrarily small.

12 pages, 2 figures; added proof of verification sub-protocol, minor corrections

References in corpus (4)

• Long-distance quantum communication with atomic ensembles and linear optics
• Quantum key distribution over 40 dB channel loss using superconducting single photon detectors
• Quantum Repeaters with Photon Pair Sources and Multi-Mode Memories
• An information-theoretic security proof for QKD protocols

Cited by in corpus (7)

• The Case for Quantum Key Distribution
• Quantum Network: Security Assessment and Key Management
• Securing a Quantum Key Distribution Network Using Secret Sharing
• Security of Trusted Repeater Quantum Key Distribution Networks
• Advantage of the key relay protocol over secure network coding
• Relay QKD Networks & Bit Transport
• Asynchronous QKD on a Relay Network