Name
Title | ||
|---|---|---|
Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers |
Abstract | ||
|---|---|---|
In this paper, we study the problem of
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">private and secure distributed matrix multiplication (PSDMM)</i>
, where a user having a private matrix
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$A$ </tex-math></inline-formula>
and
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula>
non-colluding servers sharing a library of
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula>
(
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L>1$ </tex-math></inline-formula>
) matrices
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$B^{(0)}, B^{(1)},\ldots,B^{(L-1)}$ </tex-math></inline-formula>
, for which the user wishes to compute
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$AB^{(\theta)}$ </tex-math></inline-formula>
for some
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\theta \in [0, L$ </tex-math></inline-formula>
) without revealing any information of the matrix
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$A$ </tex-math></inline-formula>
to the servers, and keeping the index
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\theta $ </tex-math></inline-formula>
private to the servers. Previous work is limited to the case that the shared library (
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e.,</i>
the matrices
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$B^{(0)}, B^{(1)},\ldots,B^{(L-1)}$ </tex-math></inline-formula>
) is stored across the servers in a replicated form and schemes are very scarce in the literature, there is still much room for improvement. In this paper, we propose two PSDMM schemes, where one is limited to the case that the shared library is stored across the servers in a replicated form but has a better performance than state-of-the-art schemes in that it can achieve a smaller recovery threshold and download cost. The other one focuses on the case that the shared library is stored across the servers in an MDS-coded form, which requires less storage in the servers. The second PSDMM code does not subsume the first one even if the underlying MDS code is degraded to a repetition code as they are totally two different schemes. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TIFS.2022.3147638 | IEEE Transactions on Information Forensics and Security |
Keywords | DocType | Volume |
Distributed computation,privacy,secure,distributed matrix multiplication | Journal | 17 |
ISSN | Citations | PageRank |
1556-6013 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jie Li | 1 | 48 | 6.35 |
| Camilla Hollanti | 2 | 0 | 0.68 |