Notes on Communication and Computation in Secure Distributed Matrix Multiplication

V. Strassen, “Gaussian elimination is not optimal,” Numerische Mathematik , vol. 13, no. 4, pp. 354–356, 1969

1969

Earlier work this paper cites.

D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” Journal of symbolic computation , vol. 9, no. 3, pp. 251–280, 1990

1990

Earlier work this paper cites.

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” in Proceedings of IEEE 36th Annual Foundations of Computer Science . IEEE, 1995, pp. 41–50

1995

Earlier work this paper cites.

J. Katz, A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone, Handbook of applied cryptography . CRC press, 1996

1996

Earlier work this paper cites.

R. R. Howell, “On asymptotic notation with multiple variables,” Tech. Rep. , 2008

2008

Earlier work this paper cites.

R. P. Brent and P. Zimmermann, Modern computer arithmetic . Cambridge University Press, 2010, vol. 18

2010

Earlier work this paper cites.

S. B. Gashkov and I. S. Sergeev, “Complexity of computation in finite fields,” Journal of Mathematical Sciences , vol. 191, no. 5, pp. 661–685, 2013

2013

Earlier work this paper cites.

F. Le Gall, “Powers of tensors and fast matrix multiplication,” in Proceedings of the 39th international symposium on symbolic and algebraic computation . ACM, 2014, pp. 296–303

2014

Earlier work this paper cites.

Q. Yu, M. Maddah-Ali, and A. S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” in Advances in Neural Information Processing Systems , 2017, pp. 4403–4413

2017

Earlier work this paper cites.

S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,” IEEE Transactions on Information Theory , vol. 64, no. 1, pp. 109–128, 2017

2017

Cited alongside, same era.

H. Sun and S. A. Jafar, “The capacity of robust private information retrieval with colluding databases,” IEEE Transactions on Information Theory , vol. 64, no. 4, pp. 2361–2370, 2017

Original

2017

Cited alongside, same era.

W.-T. Chang and R. Tandon, “On the capacity of secure distributed matrix multiplication,” in 2018 IEEE Global Communications Conference (GLOBECOM) . IEEE, 2018, pp. 1–6

2018

Cited alongside, same era.

U. Sheth, S. Dutta, M. Chaudhari, H. Jeong, Y. Yang, J. Kohonen, T. Roos, and P. Grover, “An application of storage-optimal matdot codes for coded matrix multiplication: Fast k-nearest neighbors estimation,” in 2018 IEEE International Conference on Big Data (Big Data) . IEEE, 2018, pp. 1113–1120

2018

J. Kakar, A. Khristoforov, S. Ebadifar, and A. Sezgin, “Uplink-downlink tradeoff in secure distributed matrix multiplication,” ArXiv , vol. abs/1910.13849, 2019

Original

2019

Later among the works it cites.

W.-T. Chang and R. Tandon, “On the upload versus download cost for secure and private matrix multiplication,” ArXiv , vol. abs/1906.10684, 2019

Original

2019

Later among the works it cites.

Z. Jia and S. A. Jafar, “On the capacity of secure distributed matrix multiplication,” 2019

2019

Later among the works it cites.

S. Dutta, M. Fahim, F. Haddadpour, H. Jeong, V. Cadambe, and P. Grover, “On the optimal recovery threshold of coded matrix multiplication,” IEEE Transactions on Information Theory , 2019

2019

Later among the works it cites.

R. G. L. D’Oliveira and S. El Rouayheb, “One-Shot PIR: Refinement and Lifting,” IEEE Transactions on Information Theory , pp. 1–1, 2019