{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EZYO7Z5CPYWTYAQ5OWEFX5WZNO","short_pith_number":"pith:EZYO7Z5C","schema_version":"1.0","canonical_sha256":"2670efe7a27e2d3c021d75885bf6d96bb59c349e32c42637d6cbe2c81518ec33","source":{"kind":"arxiv","id":"1011.5567","version":1},"attestation_state":"computed","paper":{"title":"Secure Multiparty Computation with Partial Fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Amos Beimel, Eran Omri, Ilan Orlov","submitted_at":"2010-11-25T08:37:52Z","abstract_excerpt":"A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns the output of the functionality to all parties. In particular, in the ideal model such computation is fair -- all parties get the output. Cleve (STOC 1986) proved that, in general, fairness is not possible without an honest majority. To overcome this impossibility, Gordon and Katz (Eurocrypt 2010) suggested a relaxed definition -- 1/p-secure computation -- which guarantees partial fairness. For t"},"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":"1011.5567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-25T08:37:52Z","cross_cats_sorted":[],"title_canon_sha256":"c631e7bb6cfd1f7eafc7a0722237d1f9a6fe2d7a670a03a0793bdb1d14810571","abstract_canon_sha256":"5e4e27c367d52e37fdb9169276aac8247b7ae3a634253322ba4db3878c4d9d57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:45.536088Z","signature_b64":"qRxR6tDJXnP0xZavEgnTdg2LgyGTNFLZT/ycz+TMAiQGIg8tp3i8hokzfqVGfBkD89CAz8qc1zJB1ugNoutjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2670efe7a27e2d3c021d75885bf6d96bb59c349e32c42637d6cbe2c81518ec33","last_reissued_at":"2026-05-18T04:34:45.535686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:45.535686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Multiparty Computation with Partial Fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Amos Beimel, Eran Omri, Ilan Orlov","submitted_at":"2010-11-25T08:37:52Z","abstract_excerpt":"A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns the output of the functionality to all parties. In particular, in the ideal model such computation is fair -- all parties get the output. Cleve (STOC 1986) proved that, in general, fairness is not possible without an honest majority. To overcome this impossibility, Gordon and Katz (Eurocrypt 2010) suggested a relaxed definition -- 1/p-secure computation -- which guarantees partial fairness. For t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5567","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":"1011.5567","created_at":"2026-05-18T04:34:45.535745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5567v1","created_at":"2026-05-18T04:34:45.535745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5567","created_at":"2026-05-18T04:34:45.535745+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZYO7Z5CPYWT","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZYO7Z5CPYWTYAQ5","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZYO7Z5C","created_at":"2026-05-18T12:26:06.534383+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/EZYO7Z5CPYWTYAQ5OWEFX5WZNO","json":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO.json","graph_json":"https://pith.science/api/pith-number/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/graph.json","events_json":"https://pith.science/api/pith-number/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/events.json","paper":"https://pith.science/paper/EZYO7Z5C"},"agent_actions":{"view_html":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO","download_json":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO.json","view_paper":"https://pith.science/paper/EZYO7Z5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5567&json=true","fetch_graph":"https://pith.science/api/pith-number/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/graph.json","fetch_events":"https://pith.science/api/pith-number/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/action/storage_attestation","attest_author":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/action/author_attestation","sign_citation":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/action/citation_signature","submit_replication":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/action/replication_record"}},"created_at":"2026-05-18T04:34:45.535745+00:00","updated_at":"2026-05-18T04:34:45.535745+00:00"}