On the Upload versus Download Cost for Secure and Private Matrix Multiplication

M. Aliasgari, O. Simeone, and J. Kliewer, “Distributed and private coded matrix computation with flexible communication load,” CoRR , vol. abs/1901.07705, 2019. [Online]. Available: http://arxiv.org/abs/1901.07705

Original

1901

Earlier work this paper cites.

M. Kim and J. Lee, “Private secure coded computation,” CoRR , vol. abs/1902.00167, 2019. [Online]. Available: http://arxiv.org/abs/1902.00167

Original

1902

Earlier work this paper cites.

R. Bitar, P. Parag, and S. E. Rouayheb, “Minimizing latency for secure distributed computing,” in 2017 IEEE International Symposium on Information Theory (ISIT) , Jun. 2017, pp. 2900–2904

2017

Earlier work this paper cites.

H. Sun and S. A. Jafar, “The capacity of private information retrieval,” IEEE Transactions on Information Theory , vol. 63, no. 7, pp. 4075–4088, Jul. 2017

2017

Earlier work this paper cites.

H. Sun and S. A. Jafar, “The capacity of private computation,” CoRR , vol. abs/1710.11098, 2017. [Online]. Available: http://arxiv.org/abs/1710.11098

Original

2017

Earlier work this paper cites.

Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “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

Earlier work this paper cites.

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

Cited alongside, same era.

H. A. Nodehi and M. A. Maddah-Ali, “Limited-sharing multi-party computation for massive matrix operations,” in 2018 IEEE International Symposium on Information Theory (ISIT) , Jun. 2018, pp. 1231–1235

2018

Cited alongside, same era.

Q. Yu, N. Raviv, J. So, and A. S. Avestimehr, “Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy,” CoRR , vol. abs/1806.00939, 2018. [Online]. Available: http://arxiv.org/abs/1806.00939

Original

2018

Cited alongside, same era.

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

2018

Cited alongside, same era.

W. Chang and R. Tandon, “On the Capacity of Secure Distributed Fast Fourier Transform,” in 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP) , Nov. 2018, pp. 653–657

2018

Later among the works it cites.

K. Banawan and S. Ulukus, “The capacity of private information retrieval from coded databases,” IEEE Transactions on Information Theory , vol. 64, no. 3, pp. 1945–1956, March 2018

2018

Later among the works it cites.

M. Mirmohseni and M. A. Maddah-Ali, “Private function retrieval,” in 2018 Iran Workshop on Communication and Information Theory (IWCIT) , Apr. 2018, pp. 1–6

2018

Later among the works it cites.

D. Karpuk, “Private computation of systematically encoded data with colluding servers,” in 2018 IEEE International Symposium on Information Theory (ISIT) , Jun. 2018, pp. 2112–2116

2018

Later among the works it cites.