{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5UNF6SV3IDEXCZ2JMIGZLMLUNF","short_pith_number":"pith:5UNF6SV3","schema_version":"1.0","canonical_sha256":"ed1a5f4abb40c9716749620d95b174696ab9a57af23fdd25dd478499ceded0ca","source":{"kind":"arxiv","id":"2105.00962","version":2},"attestation_state":"computed","paper":{"title":"From Fairness to Full Security in Multiparty Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Eran Omri, Iftach Haitner, Lior Rotem, Ran Cohen","submitted_at":"2021-05-03T16:00:22Z","abstract_excerpt":"In the setting of secure multiparty computation (MPC), a set of mutually distrusting parties wish to jointly compute a function, while guaranteeing the privacy of their inputs and the correctness of the output. An MPC protocol is called \\emph{fully secure} if no adversary can prevent the honest parties from obtaining their outputs. A protocol is called \\emph{fair} if an adversary can prematurely abort the computation, however, only before learning any new information.\n  We present highly efficient transformations from fair computations to fully secure computations, assuming the fraction of hon"},"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":"2105.00962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2021-05-03T16:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"ed4938de07b428733c33d83e8580461345531f5cee56006655482e06812f388c","abstract_canon_sha256":"e4c8947a57a756b918b8668060a2c1baa5edf3c80f7e628734ccc73644e1491a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:59.178081Z","signature_b64":"RygkQ+bhJHu0Xo2+ufIfMbPMowKl1ob7SAPTYH8jG9oL3iQf8R2k7nbZkPqGaSKPl9WKkZW0Hk8nQmSTvctaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed1a5f4abb40c9716749620d95b174696ab9a57af23fdd25dd478499ceded0ca","last_reissued_at":"2026-07-05T02:37:59.177589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:59.177589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Fairness to Full Security in Multiparty Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Eran Omri, Iftach Haitner, Lior Rotem, Ran Cohen","submitted_at":"2021-05-03T16:00:22Z","abstract_excerpt":"In the setting of secure multiparty computation (MPC), a set of mutually distrusting parties wish to jointly compute a function, while guaranteeing the privacy of their inputs and the correctness of the output. An MPC protocol is called \\emph{fully secure} if no adversary can prevent the honest parties from obtaining their outputs. A protocol is called \\emph{fair} if an adversary can prematurely abort the computation, however, only before learning any new information.\n  We present highly efficient transformations from fair computations to fully secure computations, assuming the fraction of hon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.00962","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/2105.00962/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":"2105.00962","created_at":"2026-07-05T02:37:59.177645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.00962v2","created_at":"2026-07-05T02:37:59.177645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.00962","created_at":"2026-07-05T02:37:59.177645+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UNF6SV3IDEX","created_at":"2026-07-05T02:37:59.177645+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UNF6SV3IDEXCZ2J","created_at":"2026-07-05T02:37:59.177645+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UNF6SV3","created_at":"2026-07-05T02:37:59.177645+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/5UNF6SV3IDEXCZ2JMIGZLMLUNF","json":"https://pith.science/pith/5UNF6SV3IDEXCZ2JMIGZLMLUNF.json","graph_json":"https://pith.science/api/pith-number/5UNF6SV3IDEXCZ2JMIGZLMLUNF/graph.json","events_json":"https://pith.science/api/pith-number/5UNF6SV3IDEXCZ2JMIGZLMLUNF/events.json","paper":"https://pith.science/paper/5UNF6SV3"},"agent_actions":{"view_html":"https://pith.science/pith/5UNF6SV3IDEXCZ2JMIGZLMLUNF","download_json":"https://pith.science/pith/5UNF6SV3IDEXCZ2JMIGZLMLUNF.json","view_paper":"https://pith.science/paper/5UNF6SV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.00962&json=true","fetch_graph":"https://pith.science/api/pith-number/5UNF6SV3IDEXCZ2JMIGZLMLUNF/graph.json","fetch_events":"https://pith.science/api/pith-number/5UNF6SV3IDEXCZ2JMIGZLMLUNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UNF6SV3IDEXCZ2JMIGZLMLUNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UNF6SV3IDEXCZ2JMIGZLMLUNF/action/storage_attestation","attest_author":"https://pith.science/pith/5UNF6SV3IDEXCZ2JMIGZLMLUNF/action/author_attestation","sign_citation":"https://pith.science/pith/5UNF6SV3IDEXCZ2JMIGZLMLUNF/action/citation_signature","submit_replication":"https://pith.science/pith/5UNF6SV3IDEXCZ2JMIGZLMLUNF/action/replication_record"}},"created_at":"2026-07-05T02:37:59.177645+00:00","updated_at":"2026-07-05T02:37:59.177645+00:00"}