{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L2ZU6QWGQ4A43VBSO2FDRXG67L","short_pith_number":"pith:L2ZU6QWG","schema_version":"1.0","canonical_sha256":"5eb34f42c68701cdd432768a38dcdefadfa0e375fe7a26a0ca5277fdb95c9289","source":{"kind":"arxiv","id":"2603.22857","version":2},"attestation_state":"computed","paper":{"title":"Secure Two-Party Matrix Multiplication from Lattices and Its Application to Encrypted Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.SY"],"primary_cat":"eess.SY","authors_text":"Kaoru Teranishi","submitted_at":"2026-03-24T06:51:51Z","abstract_excerpt":"In this study, we propose a two-party computation protocol for approximate matrix multiplication of fixed-point numbers. The proposed protocol is provably secure under standard lattice-based cryptographic assumptions and enables matrix multiplication at a desired approximation level within a single round of communication. We demonstrate the feasibility of the protocol by applying it to the secure implementation of a linear control law. Our evaluation reveals that the client achieves lower online computational complexity compared to the original controller computation, while ensuring the privac"},"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":"2603.22857","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-03-24T06:51:51Z","cross_cats_sorted":["cs.CR","cs.SY"],"title_canon_sha256":"c4550d37204f7168cdd06f76da61c8b07820a8d8da34e4ccbcee3ff3d7ce9f53","abstract_canon_sha256":"68931e5d96d0d4331ad847a13ff9a76e1332beeca1c1764bd5d29f845573e376"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:52.529337Z","signature_b64":"a0tr+vjETIMPnTvz2FPjQ14fmDF19clXi6Xjb+A1SOWbyBCSb9XOcP6AehPFtEgk/gpNo7wKNW8VrOWGXhwSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eb34f42c68701cdd432768a38dcdefadfa0e375fe7a26a0ca5277fdb95c9289","last_reissued_at":"2026-06-02T02:04:52.528840Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:52.528840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Two-Party Matrix Multiplication from Lattices and Its Application to Encrypted Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.SY"],"primary_cat":"eess.SY","authors_text":"Kaoru Teranishi","submitted_at":"2026-03-24T06:51:51Z","abstract_excerpt":"In this study, we propose a two-party computation protocol for approximate matrix multiplication of fixed-point numbers. The proposed protocol is provably secure under standard lattice-based cryptographic assumptions and enables matrix multiplication at a desired approximation level within a single round of communication. We demonstrate the feasibility of the protocol by applying it to the secure implementation of a linear control law. Our evaluation reveals that the client achieves lower online computational complexity compared to the original controller computation, while ensuring the privac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.22857","kind":"arxiv","version":2},"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/2603.22857/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":"2603.22857","created_at":"2026-06-02T02:04:52.528897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.22857v2","created_at":"2026-06-02T02:04:52.528897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.22857","created_at":"2026-06-02T02:04:52.528897+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2ZU6QWGQ4A4","created_at":"2026-06-02T02:04:52.528897+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2ZU6QWGQ4A43VBS","created_at":"2026-06-02T02:04:52.528897+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2ZU6QWG","created_at":"2026-06-02T02:04:52.528897+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/L2ZU6QWGQ4A43VBSO2FDRXG67L","json":"https://pith.science/pith/L2ZU6QWGQ4A43VBSO2FDRXG67L.json","graph_json":"https://pith.science/api/pith-number/L2ZU6QWGQ4A43VBSO2FDRXG67L/graph.json","events_json":"https://pith.science/api/pith-number/L2ZU6QWGQ4A43VBSO2FDRXG67L/events.json","paper":"https://pith.science/paper/L2ZU6QWG"},"agent_actions":{"view_html":"https://pith.science/pith/L2ZU6QWGQ4A43VBSO2FDRXG67L","download_json":"https://pith.science/pith/L2ZU6QWGQ4A43VBSO2FDRXG67L.json","view_paper":"https://pith.science/paper/L2ZU6QWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.22857&json=true","fetch_graph":"https://pith.science/api/pith-number/L2ZU6QWGQ4A43VBSO2FDRXG67L/graph.json","fetch_events":"https://pith.science/api/pith-number/L2ZU6QWGQ4A43VBSO2FDRXG67L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2ZU6QWGQ4A43VBSO2FDRXG67L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2ZU6QWGQ4A43VBSO2FDRXG67L/action/storage_attestation","attest_author":"https://pith.science/pith/L2ZU6QWGQ4A43VBSO2FDRXG67L/action/author_attestation","sign_citation":"https://pith.science/pith/L2ZU6QWGQ4A43VBSO2FDRXG67L/action/citation_signature","submit_replication":"https://pith.science/pith/L2ZU6QWGQ4A43VBSO2FDRXG67L/action/replication_record"}},"created_at":"2026-06-02T02:04:52.528897+00:00","updated_at":"2026-06-02T02:04:52.528897+00:00"}