{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:BXJMPMLRZIWO4FBFV4GFEQ3DVG","short_pith_number":"pith:BXJMPMLR","schema_version":"1.0","canonical_sha256":"0dd2c7b171ca2cee1425af0c524363a9ad9258c1057f1a030c94983bd4511dbe","source":{"kind":"arxiv","id":"0706.2010","version":1},"attestation_state":"computed","paper":{"title":"Information-theoretic security without an honest majority","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Alain Tapp, Anne Broadbent","submitted_at":"2007-06-13T23:05:40Z","abstract_excerpt":"We present six multiparty protocols with information-theoretic security that tolerate an arbitrary number of corrupt participants. All protocols assume pairwise authentic private channels and a broadcast channel (in a single case, we require a simultaneous broadcast channel). We give protocols for veto, vote, anonymous bit transmission, collision detection, notification and anonymous message transmission. Not assuming an honest majority, in most cases, a single corrupt participant can make the protocol abort. All protocols achieve functionality never obtained before without the use of either c"},"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":"0706.2010","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CR","submitted_at":"2007-06-13T23:05:40Z","cross_cats_sorted":[],"title_canon_sha256":"17cf9cf0eabe9a5f33abcdffe84acc0f2c4fb8b23113d268e1eaa858d013fbd2","abstract_canon_sha256":"798d0d3c0f6725fa7a0e4d73e7f89c5bb7bd7d87086c65aa43f8814cb20691b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:26.870195Z","signature_b64":"On4PUyRGcY1kYmJtqQYW9cX+s4p6ad6nNRUZpNdzc7lmLn7NYznuXzS441Vknsv49ZZM0Bjes6JCDoLnAoYQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dd2c7b171ca2cee1425af0c524363a9ad9258c1057f1a030c94983bd4511dbe","last_reissued_at":"2026-05-18T01:23:26.869500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:26.869500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-theoretic security without an honest majority","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Alain Tapp, Anne Broadbent","submitted_at":"2007-06-13T23:05:40Z","abstract_excerpt":"We present six multiparty protocols with information-theoretic security that tolerate an arbitrary number of corrupt participants. All protocols assume pairwise authentic private channels and a broadcast channel (in a single case, we require a simultaneous broadcast channel). We give protocols for veto, vote, anonymous bit transmission, collision detection, notification and anonymous message transmission. Not assuming an honest majority, in most cases, a single corrupt participant can make the protocol abort. All protocols achieve functionality never obtained before without the use of either c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.2010","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":"0706.2010","created_at":"2026-05-18T01:23:26.869613+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.2010v1","created_at":"2026-05-18T01:23:26.869613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.2010","created_at":"2026-05-18T01:23:26.869613+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXJMPMLRZIWO","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXJMPMLRZIWO4FBF","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXJMPMLR","created_at":"2026-05-18T12:25:55.427421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.20028","citing_title":"Descriptor: Parasitoid Wasps and Associated Hymenoptera Dataset (DAPWH)","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04807","citing_title":"A process-based dynamic occupancy model to study range dynamics under non-equilibrium conditions","ref_index":103,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG","json":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG.json","graph_json":"https://pith.science/api/pith-number/BXJMPMLRZIWO4FBFV4GFEQ3DVG/graph.json","events_json":"https://pith.science/api/pith-number/BXJMPMLRZIWO4FBFV4GFEQ3DVG/events.json","paper":"https://pith.science/paper/BXJMPMLR"},"agent_actions":{"view_html":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG","download_json":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG.json","view_paper":"https://pith.science/paper/BXJMPMLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.2010&json=true","fetch_graph":"https://pith.science/api/pith-number/BXJMPMLRZIWO4FBFV4GFEQ3DVG/graph.json","fetch_events":"https://pith.science/api/pith-number/BXJMPMLRZIWO4FBFV4GFEQ3DVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG/action/storage_attestation","attest_author":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG/action/author_attestation","sign_citation":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG/action/citation_signature","submit_replication":"https://pith.science/pith/BXJMPMLRZIWO4FBFV4GFEQ3DVG/action/replication_record"}},"created_at":"2026-05-18T01:23:26.869613+00:00","updated_at":"2026-05-18T01:23:26.869613+00:00"}