Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication
Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication
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 are used, the higher is the communication cost. We show that this is not …