Simple proof of security of the BB84 quantum key distribution protocol

@article{Shor2000SimplePO,
  title={Simple proof of security of the BB84 quantum key distribution protocol},
  author={Shor and Preskill},
  journal={Physical review letters},
  year={2000},
  volume={85 2},
  pages={
          441-4
        }
}
  • Shor, Preskill
  • Published 1 March 2000
  • Computer Science, Medicine, Physics
  • Physical review letters
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 proven secure using methods from Lo and Chau's proof of security for a similar protocol. We then show that the security of this protocol implies the security of BB84. The entanglement purification based protocol uses Calderbank-Shor-Steane codes, and properties of these codes are used to remove the use… Expand
Simple analysis of security of the BB84 quantum key distribution protocol
  • H. Su
  • Computer Science
  • Quantum Inf. Process.
  • 2020
TLDR
A simple proof of security of the BB84 protocol is presented, achieved in an information-theoretic way without referring to the formalism of quantum error-correction codes, and it is suggested that it sheds new light on security analysis of quantum key distribution. Expand
Security proof for a simplified Bennett-Brassard 1984 quantum-key-distribution protocol
The security of quantum key distribution (QKD) has been proven for different protocols, in particular for the BB84 protocol. It has been shown that this scheme is robust against eventualExpand
Unconditional security of a K-state quantum key distribution protocol
TLDR
This paper introduces a family of key distribution protocols which generalize the PBC00 protcol and compares its key with the well-known protocols such as BB84, PBC0 and R04 and the security analysis of these protocols based on the entanglement distillation and CSS codes techniques. Expand
TITLE : Security of the BB 84 Quantum Key Distribution Protocol
The first quantum key distribution protocol, proposed in 1984 by Bennett and Brassard, is aptly called the BB84 protocol. Unlike classical cryptographic protocols, it is provably secure. We provide aExpand
Simple security proof of quantum key distribution based on complementarity
We present an approach to the unconditional security of quantum key distribution protocols based on a complementarity argument. The approach is applicable to, but not limited to, every case that hasExpand
A Simple Security Proof for Entanglement-Based Quantum Key Distribution
TLDR
It is shown by a simple security proof that for any state sent by the sender, the eavesdropper can only guess the output state with a probability that will allow her not to learn more than half of the classical Shannon information shared between the legitimate parties. Expand
Shor-Preskill-type security proof for concatenated Bennett-Brassard 1984 quantum-key-distribution protocol
We discuss a long code problem in the Bennett-Brassard 1984 (BB84) quantum-key-distribution protocol and describe how it can be overcome by concatenation of the protocol. Observing that concatenatedExpand
Security of entanglement based version of BB84 protocol for Quantum Cryptography
TLDR
The BB84 protocol which is used in Quantum Cryptography and the security aspect of entanglement based version of BB84, the ultimate way for key distribution are described. Expand
Shor-Preskill-type security proof for quantum key distribution without public announcement of bases
We give a Shor-Preskill-type security proof to quantum key distribution without public announcement of bases [W.Y. Hwang et al., Phys. Lett. A 244, 489 (1998)]. First, we modify the Lo-Chau protocolExpand
Quantum Cryptography : On the Security of the BB84 Key-Exchange Protocol
In 1984, C.H. Bennet and G. Brassard proposed a new protocol aimed to solve the problem of symmetric cryptographic key exchange. This protocol was called BB84 after the name of its authors. While aExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 23 REFERENCES
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
TLDR
A lemma is proved that extends a security proof given by Yao for a (one bit) QOT protocol to this String-QOT protocol, which implies the unconditional security of the QKD protocol despite the previous proof that unconditionally secure bit commitment schemes are impossible. Expand
A Proof of the Security of Quantum Key Distribution
We prove the security of theoretical quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, andExpand
Unconditional security in quantum cryptography
  • D. Mayers
  • Computer Science, Mathematics
  • JACM
  • 2001
TLDR
Basic techniques to prove the unconditional security of quantum crypto graphy are described and a practical variation on the protocol in which the channel is noisy and photos may be lost during the transmission is considered. Expand
Unconditional security of quantum key distribution over arbitrarily long distances
  • Lo, Châu
  • Computer Science, Medicine
  • Science
  • 1999
TLDR
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. Expand
Mixed-state entanglement and quantum error correction.
TLDR
It is proved that an EPP involving one-way classical communication and acting on mixed state M (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa, and it is proved Q is not increased by adding one- way classical communication. Expand
Good quantum error-correcting codes exist.
  • Calderbank, Shor
  • Physics, Medicine
  • Physical review. A, Atomic, molecular, and optical physics
  • 1996
TLDR
The techniques investigated in this paper can be extended so as to reduce the accuracy required for factorization of numbers large enough to be difficult on conventional computers appears to be closer to one part in billions. Expand
Science 283
  • 2050–2056
  • 1999
Comput
  • Mach. (to be published), quant-ph/9802025; preliminary version in Advances in Cryptology—Proceedings of Crypto ’96
  • 1996
Multiple particle interference and error correction
  • Proc. R. Soc. London A 452, 2551–2577 (1996), arXive e-print quantph/9601029.
  • 1996
Phys
  • Rev. A 54, 1098–1105 (1996); A. M. Steane, Proc. R. Soc. London A 452, 2551–2577
  • 1996
...
1
2
3
...