{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PPWIVW4VQZUXP6KJ4OUL2KTK62","short_pith_number":"pith:PPWIVW4V","schema_version":"1.0","canonical_sha256":"7bec8adb95866977f949e3a8bd2a6af6bdcb334b41c86c082f9402ab170336be","source":{"kind":"arxiv","id":"1607.03629","version":1},"attestation_state":"computed","paper":{"title":"Private Multi-party Matrix Multiplication and Trust Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.CR","authors_text":"Jean-Baptiste Orfila (CASYS), Jean-Guillaume Dumas (CASYS), Maxime Puys (VERIMAG - IMAG), Pascal Lafourcade (LIMOS)","submitted_at":"2016-07-13T08:03:57Z","abstract_excerpt":"This paper deals with distributed matrix multiplication. Each player owns only one row of both matrices and wishes to learn about one distinct row of the product matrix, without revealing its input to the other players. We first improve on a weighted average protocol, in order to securely compute a dot-product with a quadratic volume of communications and linear number of rounds. We also propose a protocol with five communication rounds, using a Paillier-like underlying homomorphic public key cryptosystem, which is secure in the semi-honest model or secure with high probability in the maliciou"},"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":"1607.03629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-13T08:03:57Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"ecf483a8e3830902dccbbe5991d1173ef2fe5d2a319332f6ddefa7ff946d5456","abstract_canon_sha256":"83f730781e070989fcc0581ed0c174975cea74a3e0c85557611e29b513da8f1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:07.506998Z","signature_b64":"kNiZ19+S8octbw1SPtpVGkJ9fqS8L7bN+94WN/GjQKGwnVqpAOLadjTYalyNEhYT5XLFJLloijzmkLsb8yG4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bec8adb95866977f949e3a8bd2a6af6bdcb334b41c86c082f9402ab170336be","last_reissued_at":"2026-05-18T01:11:07.506507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:07.506507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Multi-party Matrix Multiplication and Trust Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.CR","authors_text":"Jean-Baptiste Orfila (CASYS), Jean-Guillaume Dumas (CASYS), Maxime Puys (VERIMAG - IMAG), Pascal Lafourcade (LIMOS)","submitted_at":"2016-07-13T08:03:57Z","abstract_excerpt":"This paper deals with distributed matrix multiplication. Each player owns only one row of both matrices and wishes to learn about one distinct row of the product matrix, without revealing its input to the other players. We first improve on a weighted average protocol, in order to securely compute a dot-product with a quadratic volume of communications and linear number of rounds. We also propose a protocol with five communication rounds, using a Paillier-like underlying homomorphic public key cryptosystem, which is secure in the semi-honest model or secure with high probability in the maliciou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03629","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":"1607.03629","created_at":"2026-05-18T01:11:07.506579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03629v1","created_at":"2026-05-18T01:11:07.506579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03629","created_at":"2026-05-18T01:11:07.506579+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPWIVW4VQZUX","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPWIVW4VQZUXP6KJ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPWIVW4V","created_at":"2026-05-18T12:30:39.010887+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/PPWIVW4VQZUXP6KJ4OUL2KTK62","json":"https://pith.science/pith/PPWIVW4VQZUXP6KJ4OUL2KTK62.json","graph_json":"https://pith.science/api/pith-number/PPWIVW4VQZUXP6KJ4OUL2KTK62/graph.json","events_json":"https://pith.science/api/pith-number/PPWIVW4VQZUXP6KJ4OUL2KTK62/events.json","paper":"https://pith.science/paper/PPWIVW4V"},"agent_actions":{"view_html":"https://pith.science/pith/PPWIVW4VQZUXP6KJ4OUL2KTK62","download_json":"https://pith.science/pith/PPWIVW4VQZUXP6KJ4OUL2KTK62.json","view_paper":"https://pith.science/paper/PPWIVW4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03629&json=true","fetch_graph":"https://pith.science/api/pith-number/PPWIVW4VQZUXP6KJ4OUL2KTK62/graph.json","fetch_events":"https://pith.science/api/pith-number/PPWIVW4VQZUXP6KJ4OUL2KTK62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPWIVW4VQZUXP6KJ4OUL2KTK62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPWIVW4VQZUXP6KJ4OUL2KTK62/action/storage_attestation","attest_author":"https://pith.science/pith/PPWIVW4VQZUXP6KJ4OUL2KTK62/action/author_attestation","sign_citation":"https://pith.science/pith/PPWIVW4VQZUXP6KJ4OUL2KTK62/action/citation_signature","submit_replication":"https://pith.science/pith/PPWIVW4VQZUXP6KJ4OUL2KTK62/action/replication_record"}},"created_at":"2026-05-18T01:11:07.506579+00:00","updated_at":"2026-05-18T01:11:07.506579+00:00"}