Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers

Abstract

In this paper, we study the problem of \emph{private and secure distributed matrix multiplication (PSDMM)}, where a user having a private matrix $A$ and $N$ non-colluding servers sharing a library of $L$ ($L>1$) matrices $B^{(0)},B^{(1)},\dots ,B^{(L-1)}$, for which the user wishes to compute $A{B}^{(\theta )}$ for some $\theta \in [0,L)$ without revealing any information of the matrix $A$ to the servers, and keeping the index $\theta$ private to the servers. Previous work is limited to the case that the shared library (\textit{i.e.,} the matrices $B^{(0)},B^{(1)},\dots ,B^{(L-1)}$) 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.

arXiv commentAccepted for publication in the IEEE Transactions on Information Forensics and Security

References in corpus (8)

• Speeding Up Distributed Machine Learning Using Codes
• Private Information Retrieval from Coded Databases with Colluding Servers
• Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding
• Private Information Retrieval from MDS Coded Data in Distributed Storage Systems
• A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication
• Towards Practical Private Information Retrieval from MDS Array Codes
• Fast Feasible and Unfeasible Matrix Multiplication
• A non-commutative algorithm for multiplying (7 $\times$ 7) matrices using 250 multiplications

Cited by in corpus (2)

• Information-Theoretically Private Matrix Multiplication From MDS-Coded Storage
• A Systematic Approach towards Efficient Private Matrix Multiplication