Pith. sign in

REVIEW 1 cited by

Simple Proof of Security of the BB84 Quantum Key Distribution Protocol

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0003004 v2 pith:DDFFMRJW submitted 2000-03-01 quant-ph

classification quant-ph
keywords protocolsecuritybb84distributionquantumcodesproofbennett
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform

    quant-ph 2026-08 accept novelty 6.0 of 10

    When at least one of two quantum states is pure, the Uhlmann fidelity can be estimated with Θ(1/ε) queries and Θ(1/ε²) samples without knowing which state is pure, matching the optimal lower bounds.

Pith tools