{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:DDFFMRJWXMU26ILFVP3QXNPFWQ","short_pith_number":"pith:DDFFMRJW","schema_version":"1.0","canonical_sha256":"18ca564536bb29af2165abf70bb5e5b41684dc000ac3f9b6a2f4a774e5a348b0","source":{"kind":"arxiv","id":"quant-ph/0003004","version":2},"attestation_state":"computed","paper":{"title":"Simple Proof of Security of the BB84 Quantum Key Distribution Protocol","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Preskill (Caltech), Peter W. Shor (AT&T Labs Research)","submitted_at":"2000-03-01T19:17:35Z","abstract_excerpt":"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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0003004","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-03-01T19:17:35Z","cross_cats_sorted":[],"title_canon_sha256":"8d853bf125ad5e3d05a37f740dde2183bd0ecc6fc18a75a20312bd45eb4dd2bd","abstract_canon_sha256":"b8db83c6d3c4a7d0816362b137c5ca63eb486753cbce8060c88f194142ba2934"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:36:41.683428Z","signature_b64":"reyvbMvGbUAodrixE9EsdHYLR2S+SJufeutVQbllhjXkJNBMXNi+qqLSG1xW9jSa8+/TLR4GBGsl0R7FkKgGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18ca564536bb29af2165abf70bb5e5b41684dc000ac3f9b6a2f4a774e5a348b0","last_reissued_at":"2026-07-04T15:36:41.682915Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:36:41.682915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Proof of Security of the BB84 Quantum Key Distribution Protocol","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Preskill (Caltech), Peter W. Shor (AT&T Labs Research)","submitted_at":"2000-03-01T19:17:35Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0003004","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0003004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0003004","created_at":"2026-07-04T15:36:41.682968+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0003004v2","created_at":"2026-07-04T15:36:41.682968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0003004","created_at":"2026-07-04T15:36:41.682968+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDFFMRJWXMU2","created_at":"2026-07-04T15:36:41.682968+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDFFMRJWXMU26ILF","created_at":"2026-07-04T15:36:41.682968+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDFFMRJW","created_at":"2026-07-04T15:36:41.682968+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.10674","citing_title":"Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ","json":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ.json","graph_json":"https://pith.science/api/pith-number/DDFFMRJWXMU26ILFVP3QXNPFWQ/graph.json","events_json":"https://pith.science/api/pith-number/DDFFMRJWXMU26ILFVP3QXNPFWQ/events.json","paper":"https://pith.science/paper/DDFFMRJW"},"agent_actions":{"view_html":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ","download_json":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ.json","view_paper":"https://pith.science/paper/DDFFMRJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0003004&json=true","fetch_graph":"https://pith.science/api/pith-number/DDFFMRJWXMU26ILFVP3QXNPFWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DDFFMRJWXMU26ILFVP3QXNPFWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ/action/storage_attestation","attest_author":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ/action/author_attestation","sign_citation":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ/action/citation_signature","submit_replication":"https://pith.science/pith/DDFFMRJWXMU26ILFVP3QXNPFWQ/action/replication_record"}},"created_at":"2026-07-04T15:36:41.682968+00:00","updated_at":"2026-07-04T15:36:41.682968+00:00"}