We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct ...

We propose a rateless fountain coding strategy to alleviate the problem of straggling nodes - computing nodes that unpredictably slowdown or fail - in distributed matrix-vector multiplication. Our ...