{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PAZ7JW6OSP3LSM7XB44ZQHLQKM","short_pith_number":"pith:PAZ7JW6O","schema_version":"1.0","canonical_sha256":"7833f4dbce93f6b933f70f39981d705338d891a9483f6f266c9bc080a8ee1487","source":{"kind":"arxiv","id":"2004.04985","version":1},"attestation_state":"computed","paper":{"title":"Coded Secure Multi-Party Computation for Massive Matrices with Adversarial Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Ali Maddah-Ali, Mohammad Reza Aref, Seyed Reza Hoseini Najarkolaei","submitted_at":"2020-04-10T10:47:03Z","abstract_excerpt":"In this work, we consider the problem of secure multi-party computation (MPC), consisting of $\\Gamma$ sources, each has access to a large private matrix, $N$ processing nodes or workers, and one data collector or master. The master is interested in the result of a polynomial function of the input matrices. Each source sends a randomized functions of its matrix, called as its share, to each worker. The workers process their shares in interaction with each other, and send some results to the master such that it can derive the final result. There are several constraints: (1) each worker can store"},"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":"2004.04985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-04-10T10:47:03Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"3def7d8514416b26a50912c8d7fc070bb428100e0f338a8d2d9ffa51ce99cfaa","abstract_canon_sha256":"4f2415cdd0d8ca770ccf58c4cd74771a8b306eb5c44ac8871dcca3ce6fade3cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:24.407216Z","signature_b64":"EVZzONhIWdYmVdZTKe1Kgim07jE+RJvtr0oRf5vlMUdD0ELvIcdKPHnGqcvaYT6fJ8ruIqlckz0StKtL0BPSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7833f4dbce93f6b933f70f39981d705338d891a9483f6f266c9bc080a8ee1487","last_reissued_at":"2026-07-05T00:54:24.406765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:24.406765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Secure Multi-Party Computation for Massive Matrices with Adversarial Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Ali Maddah-Ali, Mohammad Reza Aref, Seyed Reza Hoseini Najarkolaei","submitted_at":"2020-04-10T10:47:03Z","abstract_excerpt":"In this work, we consider the problem of secure multi-party computation (MPC), consisting of $\\Gamma$ sources, each has access to a large private matrix, $N$ processing nodes or workers, and one data collector or master. The master is interested in the result of a polynomial function of the input matrices. Each source sends a randomized functions of its matrix, called as its share, to each worker. The workers process their shares in interaction with each other, and send some results to the master such that it can derive the final result. There are several constraints: (1) each worker can store"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04985","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/2004.04985/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":"2004.04985","created_at":"2026-07-05T00:54:24.406821+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.04985v1","created_at":"2026-07-05T00:54:24.406821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04985","created_at":"2026-07-05T00:54:24.406821+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAZ7JW6OSP3L","created_at":"2026-07-05T00:54:24.406821+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAZ7JW6OSP3LSM7X","created_at":"2026-07-05T00:54:24.406821+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAZ7JW6O","created_at":"2026-07-05T00:54:24.406821+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/PAZ7JW6OSP3LSM7XB44ZQHLQKM","json":"https://pith.science/pith/PAZ7JW6OSP3LSM7XB44ZQHLQKM.json","graph_json":"https://pith.science/api/pith-number/PAZ7JW6OSP3LSM7XB44ZQHLQKM/graph.json","events_json":"https://pith.science/api/pith-number/PAZ7JW6OSP3LSM7XB44ZQHLQKM/events.json","paper":"https://pith.science/paper/PAZ7JW6O"},"agent_actions":{"view_html":"https://pith.science/pith/PAZ7JW6OSP3LSM7XB44ZQHLQKM","download_json":"https://pith.science/pith/PAZ7JW6OSP3LSM7XB44ZQHLQKM.json","view_paper":"https://pith.science/paper/PAZ7JW6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.04985&json=true","fetch_graph":"https://pith.science/api/pith-number/PAZ7JW6OSP3LSM7XB44ZQHLQKM/graph.json","fetch_events":"https://pith.science/api/pith-number/PAZ7JW6OSP3LSM7XB44ZQHLQKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAZ7JW6OSP3LSM7XB44ZQHLQKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAZ7JW6OSP3LSM7XB44ZQHLQKM/action/storage_attestation","attest_author":"https://pith.science/pith/PAZ7JW6OSP3LSM7XB44ZQHLQKM/action/author_attestation","sign_citation":"https://pith.science/pith/PAZ7JW6OSP3LSM7XB44ZQHLQKM/action/citation_signature","submit_replication":"https://pith.science/pith/PAZ7JW6OSP3LSM7XB44ZQHLQKM/action/replication_record"}},"created_at":"2026-07-05T00:54:24.406821+00:00","updated_at":"2026-07-05T00:54:24.406821+00:00"}