Rate-Efficiency and Straggler-Robustness through Partition in Distributed Two-Sided Secure Matrix Computation

S. L. Johnsson, T. Harris, and K. K. Mathur, “Matrix multiplication on the connection machine,” in ACM/IEEE Conference on Supercomputing , Nov 1989, pp. 326–332

1989

Earlier work this paper cites.

D. Bowler, T. Miyazaki, and M. Gillan, “Parallel sparse matrix multiplication for linear scaling electronic structure calculations,” Computer Physics Communications , vol. 137, no. 2, pp. 255 – 273, 2001

2001

Earlier work this paper cites.

K. Kedlaya and C. Umans, “Fast polynomial factorization and modular composition,” SIAM Journal on Computing , vol. 40, no. 6, pp. 1767–1802, 2011

2011

Earlier work this paper cites.

D. Clarke, A. Lastovetsky, and V. Rychkov, “Column-based matrix partitioning for parallel matrix multiplication on heterogeneous processors based on functional performance models,” in Parallel Processing Workshops . Springer Berlin Heidelberg, 2012, pp. 450–459

2012

Earlier work this paper cites.

K. M. Khan and M. Shaheen, “Secure cloud services: Matrix multiplication revisited,” in International Conference on Computational Science and Engineering , Dec 2013, pp. 9–14

2013

Cited alongside, same era.

S. Zhang, H. Li, K. Jia, Y. Dai, and L. Zhao, “Efficient secure outsourcing computation of matrix multiplication in cloud computing,” in GLOBECOM , Dec 2016, pp. 1–6

2016

Cited alongside, same era.

X. Bultel, R. Ciucanu, M. Giraud, and P. Lafourcade, “Secure matrix multiplication with mapreduce,” pp. 1–10, 08 2017

2017

Cited alongside, same era.

J. Kakar and A. Sezgin, “A survey on robust interference management in wireless networks,” Entropy , vol. 19, no. 7, 2017

2017

Cited alongside, same era.

J. Li, A. Skjellum, and R. D. Falgout, “A poly-algorithm for parallel dense matrix multiplication on two-dimensional process grid topologies,” Concurrency: Practice and Experience , vol. 9, no. 5, pp. 345–389

H. A. Nodehi and M. A. Maddah-Ali, “Limited-sharing multi-party computation for massive matrix operations,” in ISIT , June 2018, pp. 1231–1235

2018

Closest in time.

Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,” ISIT , pp. 2022–2026, 2018

2018

Closest in time.

W.-T. Chang and R. Tandon, “On the capacity of secure distributed matrix multiplication,” CoRR , vol. abs/1806.00469, 2018

Original

2018

Closest in time.