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
        }
}
  • ShorPreskill
  • Published 1 March 2000
  • Computer Science
  • 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… 

Simple analysis of security of the BB84 quantum key distribution protocol

  • H. Su
  • Computer Science
    Quantum Inf. Process.
  • 2020
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.

Security proof for a simplified Bennett-Brassard 1984 quantum-key-distribution protocol

It is proved in a finite-key scenario that the security of the BB84 protocol can be maintained even with fewer measurement operators on the receiver, which allows to implement a time-bin encoding scheme with a minimum amount of resources.

Unconditional security of a K-state quantum key distribution protocol

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.

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, and a detailed proof of its security based on the approach of Shor-Preskill is provided.

Simple security proof of quantum key distribution based on complementarity

An approach to the unconditional security of quantum key distribution protocols based on a complementarity argument is presented and a secure key rate is derived for the Bennett–Brassard-1984 protocol with an arbitrary source characterized only by a single parameter representing the basis dependence.

A Simple Security Proof for Entanglement-Based Quantum Key Distribution

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.

Shor-Preskill-type security proof for concatenated Bennett-Brassard 1984 quantum-key-distribution protocol

A long code problem in the Bennett-Brassard 1984 (BB84) quantum-key-distribution protocol is discussed and the unconditional security of the concatenated BB84 protocol is given.

Security of entanglement based version of BB84 protocol for Quantum Cryptography

  • Anand SharmaV. OjhaS. Lenka
  • Computer Science, Mathematics
    2010 3rd International Conference on Computer Science and Information Technology
  • 2010
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.

Shor-Preskill-type security proof for quantum key distribution without public announcement of bases

The Lo-Chau protocol is modified once more so that it finally reduces to the quantum key distribution without public announcement of bases, and it is shown how to estimate the error rate in the code bits based on that in the checked bits in the proposed protocol.

Quantum Cryptography : On the Security of the BB84 Key-Exchange Protocol

This work will try to give an overview of security proofs of quantum key exchange protocols, focusing on the BB84 protocol.
...

References

SHOWING 1-10 OF 14 REFERENCES

Quantum Key Distribution and String Oblivious Transfer in Noisy Channels

  • D. Mayers
  • Computer Science, Mathematics
    CRYPTO
  • 1996
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.

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, and

Unconditional security in quantum cryptography

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.

Unconditional security of quantum key distribution over arbitrarily long distances

  • LoChâu
  • Computer Science
    Science
  • 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.

Mixed-state entanglement and quantum error correction.

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.

Good quantum error-correcting codes exist.

  • CalderbankShor
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1996
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.

Comput

  • Mach. (to be published), quant-ph/9802025; preliminary version in Advances in Cryptology—Proceedings of Crypto ’96
  • 1996

A and V

Quantum public key distribution

  • IBM Technical Disclosure Bulletin 28, 3153– 3163 (1985).
  • 1985