{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UZUA2TX3GFV5KWFFP22JMTITDY","short_pith_number":"pith:UZUA2TX3","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"},"canonical_sha256":"a6680d4efb316bd558a57eb4964d131e1c0c5b275724680b333b62d9a5fa9171","source":{"kind":"arxiv","id":"2205.13169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.13169","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"2205.13169v1","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13169","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"UZUA2TX3GFV5","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"pith_short_16","alias_value":"UZUA2TX3GFV5KWFF","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"pith_short_8","alias_value":"UZUA2TX3","created_at":"2026-07-05T04:26:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UZUA2TX3GFV5KWFFP22JMTITDY","target":"record","payload":{"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"},"canonical_sha256":"a6680d4efb316bd558a57eb4964d131e1c0c5b275724680b333b62d9a5fa9171","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"},"source_kind":"arxiv","source_id":"2205.13169","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zikol2WdtXS87uaPm1A+eyIYqxNTFJY80GppiKNSukSpvoFrcXvtR5vZy2zqeFFjpcxvNgbHMotNx63OzCF+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:07:08.831914Z"},"content_sha256":"f8fdacbcfb1db362d16512297cc73685c6f74559532d214b0d6bb715296fe8a6","schema_version":"1.0","event_id":"sha256:f8fdacbcfb1db362d16512297cc73685c6f74559532d214b0d6bb715296fe8a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UZUA2TX3GFV5KWFFP22JMTITDY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gm5VQQjnepK6VYHvWZ2i8JeJxc7+F6P5Zv2Js/ssPBDtUOtOOrs5/R4QXabimL3SMv8u+lI9NYzjIcAxxVR2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:07:08.832803Z"},"content_sha256":"1ade71811d29dccda7083d5fa922b20eff4f398a41c55a71d8c19520f3b15f66","schema_version":"1.0","event_id":"sha256:1ade71811d29dccda7083d5fa922b20eff4f398a41c55a71d8c19520f3b15f66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/bundle.json","state_url":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZUA2TX3GFV5KWFFP22JMTITDY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T11:07:08Z","links":{"resolver":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY","bundle":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/bundle.json","state":"https://pith.science/pith/UZUA2TX3GFV5KWFFP22JMTITDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZUA2TX3GFV5KWFFP22JMTITDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UZUA2TX3GFV5KWFFP22JMTITDY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"544d3858b44c5ab4ed55ba65f9af8ad894c93bb91863d1a1f8472f1dc243b611","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-26T05:55:45Z","title_canon_sha256":"e49ec871b87e740588fc43b83aaba0dbb9b9939f0550ea819a3ccf73010c9e0e"},"schema_version":"1.0","source":{"id":"2205.13169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.13169","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"2205.13169v1","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13169","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"UZUA2TX3GFV5","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"pith_short_16","alias_value":"UZUA2TX3GFV5KWFF","created_at":"2026-07-05T04:26:40Z"},{"alias_kind":"pith_short_8","alias_value":"UZUA2TX3","created_at":"2026-07-05T04:26:40Z"}],"graph_snapshots":[{"event_id":"sha256:1ade71811d29dccda7083d5fa922b20eff4f398a41c55a71d8c19520f3b15f66","target":"graph","created_at":"2026-07-05T04:26:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.13169/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ananya Appan, Anirudh Chandramouli, Ashish Choudhury","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-26T05:55:45Z","title":"Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13169","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f8fdacbcfb1db362d16512297cc73685c6f74559532d214b0d6bb715296fe8a6","target":"record","created_at":"2026-07-05T04:26:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"544d3858b44c5ab4ed55ba65f9af8ad894c93bb91863d1a1f8472f1dc243b611","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-05-26T05:55:45Z","title_canon_sha256":"e49ec871b87e740588fc43b83aaba0dbb9b9939f0550ea819a3ccf73010c9e0e"},"schema_version":"1.0","source":{"id":"2205.13169","kind":"arxiv","version":1}},"canonical_sha256":"a6680d4efb316bd558a57eb4964d131e1c0c5b275724680b333b62d9a5fa9171","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6680d4efb316bd558a57eb4964d131e1c0c5b275724680b333b62d9a5fa9171","first_computed_at":"2026-07-05T04:26:40.618363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:26:40.618363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5FEFCbvxo4IWW04tpS+TtYYQ2UzE24cCviF1NZkczrRYEJKOO9ii5zeI9JdEUfL9FdUrmyUxX4KYSussAX5fCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:26:40.618738Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.13169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8fdacbcfb1db362d16512297cc73685c6f74559532d214b0d6bb715296fe8a6","sha256:1ade71811d29dccda7083d5fa922b20eff4f398a41c55a71d8c19520f3b15f66"],"state_sha256":"0f899dc67f9615cac7a6bd3d2cb96c99a737a53ea2b9b88745f6a76d39a8315b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sV6EuoR7MTf+ajsLTnCbQi2oOK0g7ERaMTrSC7qpOncu29/Tf7NeaZu+FQbFSEDcXuutJWk9dNHt/pZKZD7LAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T11:07:08.839197Z","bundle_sha256":"294ad095204c72745fb7cdc636bc57e6157fc2369caebba87f1def64d30ca633"}}