9904091v1

related topics
{key, protocol, security}
{alice, bob, state}
{error, code, errors}
{let, theorem, proof}
{vol, operators, histories}
{theory, mechanics, state}
{bell, inequality, local}
{observables, space, algebra}
{operator, operators, space}
{qubit, qubits, gate}
{state, phys, rev}
{measurement, state, measurements}
{information, entropy, channel}
{states, state, optimal}

A simple proof of the unconditional security of quantum key distribution

Hoi-Kwong Lo

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.

oai_identifier:
oai:arXiv.org:quant-ph/9904091
categories:
quant-ph cs.CR
comments:
13 pages, extended abstract. Comments will be appreciated
doi:
10.1088/0305-4470/34/35/321
arxiv_id:
quant-ph/9904091
journal_ref:
J.Phys.A34:6957-6968,2001
created:
1999-04-27

Full article ▸

related documents
0608030v3
0503157v1
0009113v1
9910087v2
0403133v2
9810067v3
9703035v1
9911043v5
0505108v1
0503192v4
0201030v1
0409099v2
0107130v1
0505061v3
0310168v2
9910106v2
0703099v5
0410215v2
0503002v1
0304035v1
0111073v2
0403036v5
9911035v2
0205060v3
0211153v5