{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BRVBETEXSQENZKXMH2YZIQR3M3","short_pith_number":"pith:BRVBETEX","schema_version":"1.0","canonical_sha256":"0c6a124c979408dcaaec3eb194423b66e760fc0a10025d0e51b82ac6437b20ce","source":{"kind":"arxiv","id":"1210.4353","version":1},"attestation_state":"computed","paper":{"title":"Position-Based Quantum Cryptography and the Garden-Hose Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Florian Speelman","submitted_at":"2012-10-16T11:00:04Z","abstract_excerpt":"We study position-based cryptography in the quantum setting. We examine a class of protocols that only require the communication of a single qubit and 2n bits of classical information. To this end, we define a new model of communication complexity, the garden-hose model, which enables us to prove upper bounds on the number of EPR pairs needed to attack such schemes. This model furthermore opens up a way to link the security of position-based quantum cryptography to traditional complexity theory."},"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":"1210.4353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-16T11:00:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"7ec4563656f067ab65734981378f6286abf0f83e1c87754ef3b38c16b154abbc","abstract_canon_sha256":"d670e5239aa6e3b1ef170350b8e8f89de5fdbdf9232c8819a5167f24ef1e36be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:06.250698Z","signature_b64":"CjwwArQImEdYrv9uTOpSj1z5aIXk7YLN+TG7PTE5hgqYHWPdCfZvKMU7TOF+5rfODwTYDHCff36YCMEDDVHuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c6a124c979408dcaaec3eb194423b66e760fc0a10025d0e51b82ac6437b20ce","last_reissued_at":"2026-05-18T03:43:06.250080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:06.250080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Position-Based Quantum Cryptography and the Garden-Hose Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Florian Speelman","submitted_at":"2012-10-16T11:00:04Z","abstract_excerpt":"We study position-based cryptography in the quantum setting. We examine a class of protocols that only require the communication of a single qubit and 2n bits of classical information. To this end, we define a new model of communication complexity, the garden-hose model, which enables us to prove upper bounds on the number of EPR pairs needed to attack such schemes. This model furthermore opens up a way to link the security of position-based quantum cryptography to traditional complexity theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4353","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":""},"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":"1210.4353","created_at":"2026-05-18T03:43:06.250162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4353v1","created_at":"2026-05-18T03:43:06.250162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4353","created_at":"2026-05-18T03:43:06.250162+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRVBETEXSQEN","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRVBETEXSQENZKXM","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRVBETEX","created_at":"2026-05-18T12:27:01.376967+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/BRVBETEXSQENZKXMH2YZIQR3M3","json":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3.json","graph_json":"https://pith.science/api/pith-number/BRVBETEXSQENZKXMH2YZIQR3M3/graph.json","events_json":"https://pith.science/api/pith-number/BRVBETEXSQENZKXMH2YZIQR3M3/events.json","paper":"https://pith.science/paper/BRVBETEX"},"agent_actions":{"view_html":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3","download_json":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3.json","view_paper":"https://pith.science/paper/BRVBETEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4353&json=true","fetch_graph":"https://pith.science/api/pith-number/BRVBETEXSQENZKXMH2YZIQR3M3/graph.json","fetch_events":"https://pith.science/api/pith-number/BRVBETEXSQENZKXMH2YZIQR3M3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/action/storage_attestation","attest_author":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/action/author_attestation","sign_citation":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/action/citation_signature","submit_replication":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/action/replication_record"}},"created_at":"2026-05-18T03:43:06.250162+00:00","updated_at":"2026-05-18T03:43:06.250162+00:00"}