.png){kind=icon}
.png){kind=icon}
Return
Bivariate Polynomial Codes for Secure Distributed Matrix Multiplication
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2022.3142355.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of secure distributed matrix multiplication (SDMM). Coded computation has been shown to be an effective solution in distributed matrix multiplication, both providing privacy against workers and boosting the computation speed by efficiently mitigating stragglers. In this work, we present a non-direct secure extension of the recently introduced bivariate polynomial codes. Bivariate polynomial codes have been shown to be able to further speed up distributed matrix multiplication by exploiting the partial work done by the stragglers rather than completely ignoring them while reducing the upload communication cost and/or the workers' storage's capacity needs. We show that, especially for upload communication or storage constrained settings, the proposed approach reduces the average computation time of SDMM compared to its competitors in the literature.
Keywords:
Codes
Encoding
Costs
Task analysis
Decoding
Government
Galois fields
Coded secure computation
bivariate polynomial codes
distributed computation
secure distributed matrix multiplication
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W