{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AE7HF4JODNEC5B6WB2G42IG3XI","short_pith_number":"pith:AE7HF4JO","schema_version":"1.0","canonical_sha256":"013e72f12e1b482e87d60e8dcd20dbba0ce09c982753fc9fecf0b90ac0034bcf","source":{"kind":"arxiv","id":"2201.12194","version":2},"attestation_state":"computed","paper":{"title":"Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Ananya Appan, Anirudh Chandramouli, Ashish Choudhury","submitted_at":"2022-01-28T15:49:08Z","abstract_excerpt":"Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. An MPC protocol allows a set of $n$ mutually distrusting parties to carry out any joint computation of their private inputs, without disclosing any additional information about their inputs. MPC with information-theoretic security provides the strongest security guarantees and remains secure even against computationally unbounded adversaries. Perfectly-secure MPC protocols is a class of information-theoretically secure MPC protocols, which provides all the security guarantees in an error-free fashion"},"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":"2201.12194","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-01-28T15:49:08Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"cb39f835f6a78c433f957100259983d7a143a9a0db11bbd1be67b9a8c1fed6ac","abstract_canon_sha256":"bd631e48f5872fa290138fe7f329c51e6e0c9d3cdee5f312909e0a094048dbcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:12.257421Z","signature_b64":"c/Gn40f1poxLnVKDzL9Oyl+G8kfF/yPo5kodKFJz7YoIniPVB6wvJZUymKRQOEuI1kJG8XmY65xbJIwrh7/wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"013e72f12e1b482e87d60e8dcd20dbba0ce09c982753fc9fecf0b90ac0034bcf","last_reissued_at":"2026-07-05T04:47:12.256881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:12.256881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Ananya Appan, Anirudh Chandramouli, Ashish Choudhury","submitted_at":"2022-01-28T15:49:08Z","abstract_excerpt":"Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. An MPC protocol allows a set of $n$ mutually distrusting parties to carry out any joint computation of their private inputs, without disclosing any additional information about their inputs. MPC with information-theoretic security provides the strongest security guarantees and remains secure even against computationally unbounded adversaries. Perfectly-secure MPC protocols is a class of information-theoretically secure MPC protocols, which provides all the security guarantees in an error-free fashion"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12194","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/2201.12194/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":"2201.12194","created_at":"2026-07-05T04:47:12.256957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12194v2","created_at":"2026-07-05T04:47:12.256957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12194","created_at":"2026-07-05T04:47:12.256957+00:00"},{"alias_kind":"pith_short_12","alias_value":"AE7HF4JODNEC","created_at":"2026-07-05T04:47:12.256957+00:00"},{"alias_kind":"pith_short_16","alias_value":"AE7HF4JODNEC5B6W","created_at":"2026-07-05T04:47:12.256957+00:00"},{"alias_kind":"pith_short_8","alias_value":"AE7HF4JO","created_at":"2026-07-05T04:47:12.256957+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/AE7HF4JODNEC5B6WB2G42IG3XI","json":"https://pith.science/pith/AE7HF4JODNEC5B6WB2G42IG3XI.json","graph_json":"https://pith.science/api/pith-number/AE7HF4JODNEC5B6WB2G42IG3XI/graph.json","events_json":"https://pith.science/api/pith-number/AE7HF4JODNEC5B6WB2G42IG3XI/events.json","paper":"https://pith.science/paper/AE7HF4JO"},"agent_actions":{"view_html":"https://pith.science/pith/AE7HF4JODNEC5B6WB2G42IG3XI","download_json":"https://pith.science/pith/AE7HF4JODNEC5B6WB2G42IG3XI.json","view_paper":"https://pith.science/paper/AE7HF4JO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12194&json=true","fetch_graph":"https://pith.science/api/pith-number/AE7HF4JODNEC5B6WB2G42IG3XI/graph.json","fetch_events":"https://pith.science/api/pith-number/AE7HF4JODNEC5B6WB2G42IG3XI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AE7HF4JODNEC5B6WB2G42IG3XI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AE7HF4JODNEC5B6WB2G42IG3XI/action/storage_attestation","attest_author":"https://pith.science/pith/AE7HF4JODNEC5B6WB2G42IG3XI/action/author_attestation","sign_citation":"https://pith.science/pith/AE7HF4JODNEC5B6WB2G42IG3XI/action/citation_signature","submit_replication":"https://pith.science/pith/AE7HF4JODNEC5B6WB2G42IG3XI/action/replication_record"}},"created_at":"2026-07-05T04:47:12.256957+00:00","updated_at":"2026-07-05T04:47:12.256957+00:00"}