{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OIQCFM7KSV6MKPIUR27QYXKXTL","short_pith_number":"pith:OIQCFM7K","schema_version":"1.0","canonical_sha256":"722022b3ea957cc53d148ebf0c5d579afd08c24a01f02eabea67b09327594253","source":{"kind":"arxiv","id":"1310.3486","version":1},"attestation_state":"computed","paper":{"title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.DS","authors_text":"Jared Saia, Mahnush Movahedi, Valerie King, Varsha Dani","submitted_at":"2013-10-13T14:29:24Z","abstract_excerpt":"We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static adversary. For any function f over a field that can be computed by a circuit with m gates, our algorithm requires each player to send a number of field elements and perform an amount of computation that is O (m/n + \\sqrt{n}). This significantly improves over traditional algorithms, which require each player to both send a number of messages and perform computation that is {\\Omega}(nm). Additionally, we define the thr"},"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":"1310.3486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-13T14:29:24Z","cross_cats_sorted":["cs.CR","cs.DC"],"title_canon_sha256":"f84e019a391e2ff04f3d77034635cb59eb05023c11079e9fb778d8b789f67ad6","abstract_canon_sha256":"2fece579daa8b2c336c39d8489666ecd0026bcb4919837b32c0950f41e7cc152"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:35.589636Z","signature_b64":"CseX4aUBAV1E7J3bYrjnNaav3XylyhRv6clzgH5TD0kUtIqrorJ1zXS1G7vaNfyrvs/9ET2ZmS5bRZ2d5rldDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"722022b3ea957cc53d148ebf0c5d579afd08c24a01f02eabea67b09327594253","last_reissued_at":"2026-05-18T03:10:35.589106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:35.589106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.DS","authors_text":"Jared Saia, Mahnush Movahedi, Valerie King, Varsha Dani","submitted_at":"2013-10-13T14:29:24Z","abstract_excerpt":"We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static adversary. For any function f over a field that can be computed by a circuit with m gates, our algorithm requires each player to send a number of field elements and perform an amount of computation that is O (m/n + \\sqrt{n}). This significantly improves over traditional algorithms, which require each player to both send a number of messages and perform computation that is {\\Omega}(nm). Additionally, we define the thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3486","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":""},"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":"1310.3486","created_at":"2026-05-18T03:10:35.589196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3486v1","created_at":"2026-05-18T03:10:35.589196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3486","created_at":"2026-05-18T03:10:35.589196+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIQCFM7KSV6M","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIQCFM7KSV6MKPIU","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIQCFM7K","created_at":"2026-05-18T12:27:54.935989+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/OIQCFM7KSV6MKPIUR27QYXKXTL","json":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL.json","graph_json":"https://pith.science/api/pith-number/OIQCFM7KSV6MKPIUR27QYXKXTL/graph.json","events_json":"https://pith.science/api/pith-number/OIQCFM7KSV6MKPIUR27QYXKXTL/events.json","paper":"https://pith.science/paper/OIQCFM7K"},"agent_actions":{"view_html":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL","download_json":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL.json","view_paper":"https://pith.science/paper/OIQCFM7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3486&json=true","fetch_graph":"https://pith.science/api/pith-number/OIQCFM7KSV6MKPIUR27QYXKXTL/graph.json","fetch_events":"https://pith.science/api/pith-number/OIQCFM7KSV6MKPIUR27QYXKXTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/action/storage_attestation","attest_author":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/action/author_attestation","sign_citation":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/action/citation_signature","submit_replication":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/action/replication_record"}},"created_at":"2026-05-18T03:10:35.589196+00:00","updated_at":"2026-05-18T03:10:35.589196+00:00"}