On the Capacity of Secure Distributed Matrix Multiplication

A. Shamir, “How to share a secret,” Communications of the ACM , vol. 22, no. 11, pp. 612–613, Nov. 1979

1979

Earlier work this paper cites.

A. C. Yao, “Protocols for secure computations,” in 23rd Annual Symposium on Foundations of Computer Science , Nov. 1982, pp. 160–164

1982

Earlier work this paper cites.

D. Chaum, I. B. Damgård, and J. van de Graaf, “Multiparty computations ensuring privacy of each party’s input and correctness of the result,” in Advances in Cryptology . Berlin, Heidelberg: Springer Berlin Heidelberg, 1988, pp. 87–119

1988

Earlier work this paper cites.

M. Jakobsson and A. Juels, “Mix and match: Secure function evaluation via ciphertexts,” in Advances in Cryptology . Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 162–177

2000

Earlier work this paper cites.

T. M. Cover and J. A. Thomas, Elements of Information Theory . Wiley-Interscience, 2006

2006

Earlier work this paper cites.

S. Rane, W. Sun, and A. Vetro, “Secure function evaluation based on secret sharing and homomorphic encryption,” in 47th Annual Allerton Conference on Communication, Control, and Computing , Sep. 2009, pp. 827–834

2009

Cited alongside, same era.

M. Van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully homomorphic encryption over the integers,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2010, pp. 24–43

2010

Cited alongside, same era.

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

2013

Cited alongside, same era.

D. H. Duong, P. K. Mishra, and M. Yasuda, “Efficient secure matrix multiplication over lwe-based homomorphic encryption,” Tatra Mountains Mathematical Publications , vol. 67, no. 1, pp. 69–83, 2016

2016

Cited alongside, same era.

X. Bultel, R. Ciucanu, M. Giraud, and P. Lafourcade, “Secure matrix multiplication with mapreduce,” in Proceedings of the 12th International Conference on Availability, Reliability and Security . New York, NY, USA: ACM, 2017, pp. 11:1–11:10

2017

Later among the works it cites.

Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” CoRR , vol. abs/1705.10464, 2017. [Online]. Available: http://arxiv.org/abs/1705.10464

Original

2017

Later among the works it cites.

——, “Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,” CoRR , vol. abs/1801.07487, 2018. [Online]. Available: http://arxiv.org/abs/1801.07487

Original

2018

Closest in time.

S. Dutta, M. Fahim, F. Haddadpour, H. Jeong, V. R. Cadambe, and P. Grover, “On the optimal recovery threshold of coded matrix multiplication,” CoRR , vol. abs/1801.10292, 2018. [Online]. Available: http://arxiv.org/abs/1801.10292

Original

2018