• Corpus ID: 118455796

Quantum Error Correcting Codes and the Security Proof of the BB84 Protocol

  title={Quantum Error Correcting Codes and the Security Proof of the BB84 Protocol},
  author={Ramesh Bhandari},
  journal={arXiv: Quantum Physics},
  • R. Bhandari
  • Published 30 August 2014
  • Computer Science
  • arXiv: Quantum Physics
We describe the popular BB84 protocol and critically examine its security proof as presented by Shor and Preskill. The proof requires the use of quantum error correcting codes called the Calderbank-Shor-Steanne (CSS) quantum codes. These quantum codes are constructed in the quantum domain from two suitable classical linear codes, one used to correct for bit-flip errors and the other for phase-flip errors. Consequently, as a prelude to the security proof, the report reviews the essential… 


Simple proof of security of the BB84 quantum key distribution protocol
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
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
  • D. Mayers
  • Computer Science, Mathematics
  • 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.
Good quantum error-correcting codes exist.
  • Calderbank, Shor
  • 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.
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.
The security of practical quantum key distribution
Essential theoretical tools that have been developed to assess the security of the main experimental platforms are presented (discrete- variable, continuous-variable, and distributed-phase-reference protocols).
Secret-Key Reconciliation by Public Discussion
A more efficient protocol is presented, which leaks an amount of information acceptably close to the minimum possible for sufficiently reliable secret channels (those with probability of any symbol being transmitted incorrectly as large as 15%).
Unconditional security of quantum key distribution over arbitrarily long distances
  • Lo, Châu
  • Computer 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.
Quantum Computation and Quantum Information
This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
Generalized privacy amplification
This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard and Robert (1988) for a special scenario. The results have