{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UZUA2TX3GFV5KWFFP22JMTITDY","short_pith_number":"pith:UZUA2TX3","schema_version":"1.0","canonical_sha256":"a6680d4efb316bd558a57eb4964d131e1c0c5b275724680b333b62d9a5fa9171","source":{"kind":"arxiv","id":"2205.13169","version":1},"attestation_state":"computed","paper":{"title":"Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ananya Appan, Anirudh Chandramouli, Ashish Choudhury","submitted_at":"2022-05-26T05:55:45Z","abstract_excerpt":"In this paper, we design secure multi-party computation (MPC) protocols in the asynchronous communication setting with optimal resilience. Our protocols are secure against a computationally-unbounded malicious adversary, characterized by an adversary structure $\\mathcal{Z}$, which enumerates all possible subsets of potentially corrupt parties. Our protocols incur a communication of $\\mathcal{O}(|\\mathcal{Z}|^2)$ and $\\mathcal{O}(|\\mathcal{Z}|)$ bits per multiplication for perfect and statistical security respectively. These are the first protocols with this communication complexity, as such pr"},"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":"2205.13169","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-26T05:55:45Z","cross_cats_sorted":[],"title_canon_sha256":"e49ec871b87e740588fc43b83aaba0dbb9b9939f0550ea819a3ccf73010c9e0e","abstract_canon_sha256":"544d3858b44c5ab4ed55ba65f9af8ad894c93bb91863d1a1f8472f1dc243b611"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:40.618738Z","signature_b64":"5FEFCbvxo4IWW04tpS+TtYYQ2UzE24cCviF1NZkczrRYEJKOO9ii5zeI9JdEUfL9FdUrmyUxX4KYSussAX5fCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6680d4efb316bd558a57eb4964d131e1c0c5b275724680b333b62d9a5fa9171","last_reissued_at":"2026-07-05T04:26:40.618363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:40.618363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ananya Appan, Anirudh Chandramouli, Ashish Choudhury","submitted_at":"2022-05-26T05:55:45Z","abstract_excerpt":"In this paper, we design secure multi-party computation (MPC) protocols in the asynchronous communication setting with optimal resilience. Our protocols are secure against a computationally-unbounded malicious adversary, characterized by an adversary structure $\\mathcal{Z}$, which enumerates all possible subsets of potentially corrupt parties. Our protocols incur a communication of $\\mathcal{O}(|\\mathcal{Z}|^2)$ and $\\mathcal{O}(|\\mathcal{Z}|)$ bits per multiplication for perfect and statistical security respectively. These are the first protocols with this communication complexity, as such pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13169","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.13169/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":"2205.13169","created_at":"2026-07-05T04:26:40.618420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.13169v1","created_at":"2026-07-05T04:26:40.618420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13169","created_at":"2026-07-05T04:26:40.618420+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZUA2TX3GFV5","created_at":"2026-07-05T04:26:40.618420+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZUA2TX3GFV5KWFF","created_at":"2026-07-05T04:26:40.618420+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZUA2TX3","created_at":"2026-07-05T04:26:40.618420+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/UZUA2TX3GFV5KWFFP22JMTITDY","json":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY.json","graph_json":"https://pith.science/api/pith-number/UZUA2TX3GFV5KWFFP22JMTITDY/graph.json","events_json":"https://pith.science/api/pith-number/UZUA2TX3GFV5KWFFP22JMTITDY/events.json","paper":"https://pith.science/paper/UZUA2TX3"},"agent_actions":{"view_html":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY","download_json":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY.json","view_paper":"https://pith.science/paper/UZUA2TX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.13169&json=true","fetch_graph":"https://pith.science/api/pith-number/UZUA2TX3GFV5KWFFP22JMTITDY/graph.json","fetch_events":"https://pith.science/api/pith-number/UZUA2TX3GFV5KWFFP22JMTITDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/action/storage_attestation","attest_author":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/action/author_attestation","sign_citation":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/action/citation_signature","submit_replication":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/action/replication_record"}},"created_at":"2026-07-05T04:26:40.618420+00:00","updated_at":"2026-07-05T04:26:40.618420+00:00"}