Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication
arXiv:2108.08798 · doi:10.1109/REDUNDANCY52534.2021.9606447
Abstract
We consider the problem of communication efficient secure distributed matrix multiplication. The previous literature has focused on reducing the number of servers as a proxy for minimizing communication costs. The intuition being, that the more servers used, the higher the communication cost. We show that this is not the case. Our central technique relies on adapting results from the literature on repairing Reed-Solomon codes where instead of downloading the whole of the computing task, a user downloads field traces of these computations. We present field trace polynomial codes, a family of codes, that explore this technique and characterize regimes for which our codes outperform the existing codes in the literature.
References in corpus (7)
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication
- Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
- On the Capacity of Secure Distributed Matrix Multiplication
- Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier
- On the Capacity of Secure Distributed Batch Matrix Multiplication
- Improved Constructions for Secure Multi-Party Batch Matrix Multiplication