{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QLQ5WXUIS3SGXM6OJOOBJBZ6SN","short_pith_number":"pith:QLQ5WXUI","schema_version":"1.0","canonical_sha256":"82e1db5e8896e46bb3ce4b9c14873e936ed19c4cea1ff17801a6f822e86833f0","source":{"kind":"arxiv","id":"2206.03776","version":11},"attestation_state":"computed","paper":{"title":"High-Throughput Secure Multiparty Computation with an Honest Majority in Various Network Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ajith Suresh, Christopher Harth-Kitzerow, Georg Carle, Hossein Yalame, Murali Annavaram, Yongqin Wang","submitted_at":"2022-06-08T09:46:37Z","abstract_excerpt":"In this work, we present novel protocols over rings for semi-honest secure three-party computation (3PC) and malicious four-party computation (4PC) with one corruption. While most existing works focus on improving total communication complexity, challenges such as network heterogeneity and computational complexity, which impact MPC performance in practice, remain underexplored. Our protocols address these issues by tolerating multiple arbitrarily weak network links between parties without any substantial decrease in performance. Additionally, they significantly reduce computational complexity "},"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":"2206.03776","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2022-06-08T09:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"f73df6f224b66513d6c3ff446ede4c45519405ae0dfa6057458d0d359bf8b9bf","abstract_canon_sha256":"d802b38fa8c0bd055273df130a485d662099164f328873c6ae33814b94631c75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:18.293990Z","signature_b64":"7QWMMOsBdwMCsLcEGNEe+s4dJHQ+Vpu4vgT27S7BKbq+PrsCtBhFp79BT+UGrjZSS8eAiAKLd55GjGUvdcqVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82e1db5e8896e46bb3ce4b9c14873e936ed19c4cea1ff17801a6f822e86833f0","last_reissued_at":"2026-07-05T11:06:18.293405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:18.293405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Throughput Secure Multiparty Computation with an Honest Majority in Various Network Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ajith Suresh, Christopher Harth-Kitzerow, Georg Carle, Hossein Yalame, Murali Annavaram, Yongqin Wang","submitted_at":"2022-06-08T09:46:37Z","abstract_excerpt":"In this work, we present novel protocols over rings for semi-honest secure three-party computation (3PC) and malicious four-party computation (4PC) with one corruption. While most existing works focus on improving total communication complexity, challenges such as network heterogeneity and computational complexity, which impact MPC performance in practice, remain underexplored. Our protocols address these issues by tolerating multiple arbitrarily weak network links between parties without any substantial decrease in performance. Additionally, they significantly reduce computational complexity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03776","kind":"arxiv","version":11},"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/2206.03776/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":"2206.03776","created_at":"2026-07-05T11:06:18.293477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.03776v11","created_at":"2026-07-05T11:06:18.293477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03776","created_at":"2026-07-05T11:06:18.293477+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLQ5WXUIS3SG","created_at":"2026-07-05T11:06:18.293477+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLQ5WXUIS3SGXM6O","created_at":"2026-07-05T11:06:18.293477+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLQ5WXUI","created_at":"2026-07-05T11:06:18.293477+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31208","citing_title":"Probing Memorization of Tabular In-Context Learning","ref_index":139,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN","json":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN.json","graph_json":"https://pith.science/api/pith-number/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/graph.json","events_json":"https://pith.science/api/pith-number/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/events.json","paper":"https://pith.science/paper/QLQ5WXUI"},"agent_actions":{"view_html":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN","download_json":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN.json","view_paper":"https://pith.science/paper/QLQ5WXUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.03776&json=true","fetch_graph":"https://pith.science/api/pith-number/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/graph.json","fetch_events":"https://pith.science/api/pith-number/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/action/storage_attestation","attest_author":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/action/author_attestation","sign_citation":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/action/citation_signature","submit_replication":"https://pith.science/pith/QLQ5WXUIS3SGXM6OJOOBJBZ6SN/action/replication_record"}},"created_at":"2026-07-05T11:06:18.293477+00:00","updated_at":"2026-07-05T11:06:18.293477+00:00"}