A simple proof of the unconditional security of quantum key distribution
arXiv:quant-ph/9904091 · doi:10.1088/0305-4470/34/35/321
Abstract
Quantum key distribution is the most well-known application of quantum cryptography. Previous proposed proofs of security of quantum key distribution contain various technical subtleties. Here, a conceptually simpler proof of security of quantum key distribution is presented. The new insight is the invariance of the error rate of a teleportation channel: We show that the error rate of a teleportation channel is independent of the signals being transmitted. This is because the non-trivial error patterns are permuted under teleportation. This new insight is combined with the recently proposed quantum to classical reduction theorem. Our result shows that assuming that Alice and Bob have fault-tolerant quantum computers, quantum key distribution can be made unconditionally secure over arbitrarily long distances even against the most general type of eavesdropping attacks and in the presence of all types of noises.
13 pages, extended abstract. Comments will be appreciated
References in corpus (4)
Cited by in corpus (16)
- A quantum network stack and protocols for reliable entanglement-based networks
- Machine learning for long-distance quantum communication
- Modular architectures for quantum networks
- Practical Quantum Cryptography: A Comprehensive Analysis (Part One)
- Quantum Private Comparison: A Review
- Complete physical simulation of the entangling-probe attack on the BB84 protocol
- Secure Quantum Private Comparison of Equality Based on Asymmetric W State
- Trading quantum for classical resources in quantum data compression
- Attacking quantum key distribution with single-photon two-qubit quantum logic
- Efficient Quantum Key Distribution Scheme And Proof of Its Unconditional Security
- Entanglement generation secure against general attacks
- Security of EPR-based Quantum Key Distribution
- Provable entanglement and information cost for qubit-based quantum key-distribution protocols
- Robustness of the BB84 quantum key distribution protocol against general coherent attacks
- Simple proof of confidentiality for private quantum channels in noisy environments
- On the QKD relaying models