Metraipolis › archive › dc_8abc7d8aeae7
Low-Rank Masking for Single-Server Matrix Multiplication — arXiv:2609.18876
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18876
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:31:53.528Z
- SHA-256 of the archived text
3259fd010004743bfeadeead5848ec3a92468475a0c10bd8e1a8e03abc4fc647- Stable URL of this page
https://metraipolis.com/documento/dc_8abc7d8aeae7
How to cite
Low-Rank Masking for Single-Server Matrix Multiplication — arXiv:2609.18876 — arXiv (en), https://arxiv.org/abs/2609.18876 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8abc7d8aeae7 (Metraipolis archive dc_8abc7d8aeae7, sha256 3259fd010004743bfeadeead5848ec3a92468475a0c10bd8e1a8e03abc4fc647)
BibTeX
@misc{dc8abc7d8aeae7,
title = {Low-Rank Masking for Single-Server Matrix Multiplication — arXiv:2609.18876},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18876},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8abc7d8aeae7; sha256 3259fd010004743bfeadeead5848ec3a92468475a0c10bd8e1a8e03abc4fc647},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18876. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the statistical privacy of outsourcing matrix multiplication over a finite field ${\mathbb F_q}$ to a single server using additive masks of rank at most $r$. For independent uniform $n\times n$ inputs, we show that uniform \emph{rank-ball masks} and products of independent uniform factors give maximal-correlation secrecy of at most $q^{-r}$ against the complete server view, with $O(n^2r)$ field operations for encoding and decoding. This secrecy captures how effectively the server is prevented from estimating functions of the inputs. We prove an asymptotically matching lower bound of this secrecy measure for $r=o(n)$, showing that both sampling methods are asymptotically optimal among input-independent additive masks of rank at most $r$, even when secret invertible transformations are allowed. We also characterize the posterior distribution for uniform rank-ball masks under arbitrary joint input distributions and prove approximate individual security for rows and columns under independent uniform inputs. Finally, we show that every input-independent additive mask of rank at most $r=o(n)$ requires $\delta\to1$ in entry-level $(\varepsilon,\delta)$-differential privacy for fixed field size $q$ and bounded $\varepsilon$.
Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-17 in cs.CR).
Categorie arXiv: Information Theory (cs.IT) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.18876 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T13:56:52.908Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).