General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers
share
In this paper, a general framework for linear secure distributed matrix multiplication (SDMM) is introduced. The model allows for a neat treatment of straggling and Byzantine servers via a star product interpretation as well as simplified security proofs. Known properties of star products also immediately yield a lower bound for the recovery threshold for full-support maximum distance separable (MDS) encoding, as well as an upper bound for the colluding workers the system can tolerate. It produces many of the known SDMM schemes as special cases, hence providing unification for the previous literature on the topic. Furthermore, error behavior specific to SDMM is discussed and interleaved codes are proposed as a suitable means for efficient error correction in the proposed model. Analysis of the error correction capability is also provided, largely based on well-known results on interleaved codes.
READ FULL TEXT