{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:OUM3L76M3MUOMBC7YCRZQGWBVD","short_pith_number":"pith:OUM3L76M","schema_version":"1.0","canonical_sha256":"7519b5ffccdb28e6045fc0a3981ac1a8f8be97f41775bab0a5b29801b84a315e","source":{"kind":"arxiv","id":"quant-ph/0408120","version":1},"attestation_state":"computed","paper":{"title":"Security of Quantum Bit-String Generation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonathan Barrett, Serge Massar","submitted_at":"2004-08-19T13:19:22Z","abstract_excerpt":"We consider the cryptographic task of bit-string generation. This is a generalisation of coin tossing in which two mistrustful parties wish to generate a string of random bits such that an honest party can be sure that the other cannot have biased the string too much. We consider a quantum protocol for this task, originally introduced in Phys. Rev. A {\\bf 69}, 022322 (2004), that is feasible with present day technology. We introduce security conditions based on the average bias of the bits and the Shannon entropy of the string. For each, we prove rigorous security bounds for this protocol in b"},"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/0408120","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-08-19T13:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"7badbd8f341cd92009759a1d42540b393d687bf11683dd2e9117de5f499a38da","abstract_canon_sha256":"e3910a2e91174c6ae6f264366eb8943ceef385060949a9555f498f7a152f6961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:50:23.271993Z","signature_b64":"4S+MA9ELoapMOhN3o1P1hhDvdsQX4gnQDEMc3BrVNwZjDPVwtHwUkqFIH7F+jpzwf1SlxOvhYFOC7ur6uL4BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7519b5ffccdb28e6045fc0a3981ac1a8f8be97f41775bab0a5b29801b84a315e","last_reissued_at":"2026-07-04T16:50:23.271618Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:50:23.271618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Security of Quantum Bit-String Generation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonathan Barrett, Serge Massar","submitted_at":"2004-08-19T13:19:22Z","abstract_excerpt":"We consider the cryptographic task of bit-string generation. This is a generalisation of coin tossing in which two mistrustful parties wish to generate a string of random bits such that an honest party can be sure that the other cannot have biased the string too much. We consider a quantum protocol for this task, originally introduced in Phys. Rev. A {\\bf 69}, 022322 (2004), that is feasible with present day technology. We introduce security conditions based on the average bias of the bits and the Shannon entropy of the string. For each, we prove rigorous security bounds for this protocol in b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0408120","kind":"arxiv","version":1},"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/0408120/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/0408120","created_at":"2026-07-04T16:50:23.271679+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0408120v1","created_at":"2026-07-04T16:50:23.271679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0408120","created_at":"2026-07-04T16:50:23.271679+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUM3L76M3MUO","created_at":"2026-07-04T16:50:23.271679+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUM3L76M3MUOMBC7","created_at":"2026-07-04T16:50:23.271679+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUM3L76M","created_at":"2026-07-04T16:50:23.271679+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD","json":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD.json","graph_json":"https://pith.science/api/pith-number/OUM3L76M3MUOMBC7YCRZQGWBVD/graph.json","events_json":"https://pith.science/api/pith-number/OUM3L76M3MUOMBC7YCRZQGWBVD/events.json","paper":"https://pith.science/paper/OUM3L76M"},"agent_actions":{"view_html":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD","download_json":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD.json","view_paper":"https://pith.science/paper/OUM3L76M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0408120&json=true","fetch_graph":"https://pith.science/api/pith-number/OUM3L76M3MUOMBC7YCRZQGWBVD/graph.json","fetch_events":"https://pith.science/api/pith-number/OUM3L76M3MUOMBC7YCRZQGWBVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD/action/storage_attestation","attest_author":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD/action/author_attestation","sign_citation":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD/action/citation_signature","submit_replication":"https://pith.science/pith/OUM3L76M3MUOMBC7YCRZQGWBVD/action/replication_record"}},"created_at":"2026-07-04T16:50:23.271679+00:00","updated_at":"2026-07-04T16:50:23.271679+00:00"}