dorsal/arxiv
View SchemaLearning-Augmented Perfectly Secure Collaborative Matrix Multiplication
| Authors | Zixuan He, Mohammad Reza Deylam Salehi, Derya Malak, Photios A. Stavrou |
|---|---|
| Categories | |
| ArXiv ID | 2601.09916vv1 |
| URL | https://arxiv.org/abs/2601.09916 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
This paper presents a perfectly secure matrix multiplication (PSMM) protocol for multiparty computation (MPC) of $\mathrm{A}^{\top}\mathrm{B}$ over finite fields. The proposed scheme guarantees correctness and information-theoretic privacy against threshold-bounded, semi-honest colluding agents, under explicit local storage constraints. Our scheme encodes submatrices as evaluations of sparse masking polynomials and combines coefficient alignment with Beaver-style randomness to ensure perfect secrecy. We demonstrate that any colluding set of parties below the security threshold observes uniformly random shares, and that the recovery threshold is optimal, matching existing information-theoretic limits. Building on this framework, we introduce a learning-augmented extension that integrates tensor-decomposition-based local block multiplication, capturing both classical and learned low-rank methods. We demonstrate that the proposed learning-based PSMM preserves privacy and recovery guarantees for MPC, while providing scalable computational efficiency gains (up to $80\%$) as the matrix dimensions grow.
{
"annotation_id": "ebcd4007-d6fb-49ba-8572-f255b5c2a93e",
"date_created": "2026-02-17T05:53:24.270000Z",
"date_modified": "2026-02-17T05:53:24.270000Z",
"file_hash": "4f6f660d9df4d9f2a08cda740063a1949d3e9ab16e3038b267c0bf14eee90114",
"private": false,
"record": {
"abstract": "This paper presents a perfectly secure matrix multiplication (PSMM) protocol for multiparty computation (MPC) of $\\mathrm{A}^{\\top}\\mathrm{B}$ over finite fields. The proposed scheme guarantees correctness and information-theoretic privacy against threshold-bounded, semi-honest colluding agents, under explicit local storage constraints. Our scheme encodes submatrices as evaluations of sparse masking polynomials and combines coefficient alignment with Beaver-style randomness to ensure perfect secrecy. We demonstrate that any colluding set of parties below the security threshold observes uniformly random shares, and that the recovery threshold is optimal, matching existing information-theoretic limits. Building on this framework, we introduce a learning-augmented extension that integrates tensor-decomposition-based local block multiplication, capturing both classical and learned low-rank methods. We demonstrate that the proposed learning-based PSMM preserves privacy and recovery guarantees for MPC, while providing scalable computational efficiency gains (up to $80\\%$) as the matrix dimensions grow.",
"arxiv_id": "2601.09916",
"authors": [
"Zixuan He",
"Mohammad Reza Deylam Salehi",
"Derya Malak",
"Photios A. Stavrou"
],
"categories": [
"cs.IT",
"cs.MA",
"cs.SY",
"eess.SY",
"math.IT"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Learning-Augmented Perfectly Secure Collaborative Matrix Multiplication",
"url": "https://arxiv.org/abs/2601.09916",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5589c502-4b69-438a-ae95-720b1941daf6",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}