976 research outputs found
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
We prove the security of the 1984 protocol of Bennett and Brassard (BB84) for
quantum key distribution. 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 (CSS) codes, and properties of these
codes are used to remove the use of quantum computation from the Lo-Chau
protocol.Comment: 5 pages, Latex, minor changes to improve clarity and fix typo
Shor-Preskill Type Security-Proofs for Concatenated Bennett-Brassard 1984 Quantum Key Distribution Protocol
We discuss long code problems in the Bennett-Brassard 1984 (BB84) quantum key
distribution protocol and describe how they can be overcome by concatenation of
the protocol. Observing that concatenated modified Lo-Chau protocol finally
reduces to the concatenated BB84 protocol, we give the unconditional security
of the concatenated BB84 protocol.Comment: 4 pages, RevTe
Secure quantum key distribution using squeezed states
We prove the security of a quantum key distribution scheme based on
transmission of squeezed quantum states of a harmonic oscillator. Our proof
employs quantum error-correcting codes that encode a finite-dimensional quantum
system in the infinite-dimensional Hilbert space of an oscillator, and protect
against errors that shift the canonical variables p and q. If the noise in the
quantum channel is weak, squeezing signal states by 2.51 dB (a squeeze factor
e^r=1.34) is sufficient in principle to ensure the security of a protocol that
is suitably enhanced by classical error correction and privacy amplification.
Secure key distribution can be achieved over distances comparable to the
attenuation length of the quantum channel.Comment: 19 pages, 3 figures, RevTeX and epsf, new section on channel losse
Secure Coherent-state Quantum Key Distribution Protocols with Efficient Reconciliation
We study the equivalence between a realistic quantum key distribution
protocol using coherent states and homodyne detection and a formal entanglement
purification protocol. Maximally-entangled qubit pairs that one can extract in
the formal protocol correspond to secret key bits in the realistic protocol.
More specifically, we define a qubit encoding scheme that allows the formal
protocol to produce more than one entangled qubit pair per coherent state, or
equivalently for the realistic protocol, more than one secret key bit. The
entanglement parameters are estimated using quantum tomography. We analyze the
properties of the encoding scheme and investigate its application to the
important case of the attenuation channel.Comment: REVTeX, 11 pages, 2 figure
- …