Analog Secure Distributed Matrix Multiplication
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916914576490496 |
|---|---|
| author | Makkonen, Okko Hollanti, Camilla |
| author_facet | Makkonen, Okko Hollanti, Camilla |
| contents | In this paper, we present secure distributed matrix multiplication (SDMM) schemes over the complex numbers with good numerical stability and small mutual information leakage by utilizing polynomial interpolation with roots of unity. Furthermore, we give constructions utilizing the real numbers by first encoding the real matrices to smaller complex matrices using a technique we call complexification. These schemes over the real numbers enjoy many of the benefits of the schemes over the complex numbers, including good numerical stability, but are computationally more efficient. To analyze the numerical stability and the mutual information leakage, we give some bounds on the condition numbers of Vandermonde matrices whose evaluation points are roots of unity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_17479 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Analog Secure Distributed Matrix Multiplication Makkonen, Okko Hollanti, Camilla Information Theory In this paper, we present secure distributed matrix multiplication (SDMM) schemes over the complex numbers with good numerical stability and small mutual information leakage by utilizing polynomial interpolation with roots of unity. Furthermore, we give constructions utilizing the real numbers by first encoding the real matrices to smaller complex matrices using a technique we call complexification. These schemes over the real numbers enjoy many of the benefits of the schemes over the complex numbers, including good numerical stability, but are computationally more efficient. To analyze the numerical stability and the mutual information leakage, we give some bounds on the condition numbers of Vandermonde matrices whose evaluation points are roots of unity. |
| title | Analog Secure Distributed Matrix Multiplication |
| topic | Information Theory |
| url | https://arxiv.org/abs/2508.17479 |