Fetching the paper…
Reading the bibliography…
In secure distributed matrix multiplication (SDMM) the multiplication $\mathbf{A}\mathbf{B}$ from two private matrices $\mathbf{A}$ and $\mathbf{B}$ is outsourced by a user to $N$ distributed servers.
J. Cooley and J. Tukey, “An Algorithm for the Machine Calculation of Complex Fourier Series,” Mathematics of Computation , vol. 19, no. 90, pp. 297–301, 1965
1965
Earlier work this paper cites.
V. Strassen, “Gaussian elimination is not optimal,” Numer. Math. , vol. 13, no. 4, pp. 354–356, 1969
1969
Earlier work this paper cites.
J. M. Pollard, “The fast Fourier transform in a finite field,” Mathematics of Computation , vol. 25, pp. 365–374, 1971
1971
Earlier work this paper cites.
R. Moenck and A. Borodin, “Fast modular transforms via division,” in 13th Annual Symposium on Switching and Automata Theory (swat 1972) , 1972, pp. 90–96
1972
Earlier work this paper cites.
R. T. Moenck, “Practical fast polynomial multiplication,” in SYMSAC ’76 , 1976
1976
Earlier work this paper cites.
A. Gerasoulis, M. D. Grigoriadis, and L. Sun, “A fast algorithm for trummer’s problem,” SIAM Journal on Scientific and Statistical Computing , vol. 8, no. 1, pp. 135–138, Jan. 1987
1987
Earlier work this paper cites.
D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” Journal of Symbolic Computations , vol. 9, no. 3, pp. 251–280, Mar. 1990
1990
Earlier work this paper cites.
T. Finck, G. Heinig, and K. Rost, “An inversion formula and fast algorithms for Cauchy-Vandermonde matrices,” Linear algebra and its applications , vol. 183, pp. 179–191, 1993
1993
Earlier work this paper cites.
S. Huss-Lederman, E. M. Jacobson, J. R. Johnson, A. Tsao, and T. Turnbull, “Strassen’s algorithm for matrix multiplication: Modeling, analysis, and implementation,” in In Proceedings of Supercomputing ’96 , 1996, pp. 9–6
1996
Earlier work this paper cites.
D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms , 3rd ed. Reading, Mass.: Addison-Wesley, 1997
1997
Earlier work this paper cites.
S. Gao, “A new algorithm for decoding reed-solomon codes.” Kluwer, 2002, pp. 55–68
2002
Earlier work this paper cites.
2006
Earlier work this paper cites.
K. S. Kedlaya and C. Umans, “Fast Polynomial Factorization and Modular Composition,” SIAM J. Comput. , vol. 40, no. 6, pp. 1767–1802, Dec. 2011
2011
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.
M. Bläser, “Fast matrix multiplication,” Theory of Computing, Graduate Surveys , vol. 5, pp. 1–60, 2013
2013
Cited alongside, same era.
C. Wang, T. Gou, and S. A. Jafar, “Subspace Alignment Chains and the Degrees of Freedom of the Three-User MIMO Interference Channel,” IEEE Transactions on Information Theory , vol. 60, no. 5, pp. 2432–2479, May 2014
2014
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 2016 IEEE Global Communications Conference (GLOBECOM) , Dec 2016, pp. 1–6
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 , pp. 1–1, 2019
2019
Closest in time.
J. Kakar, S. Ebadifar, and A. Sezgin, “On the Capacity and Straggler-Robustness of Distributed Secure Matrix Multiplication,” IEEE Access , vol. 7, pp. 45 783–45 799, 2019
2019
Closest in time.
Z. Jia and S. A. Jafar, “On the Capacity of Secure Distributed Matrix Multiplication,” arXiv preprint , vol. 1908.06957, 2019
2019
Closest in time.
G. L. Rafael D’Oliveira, S. E. Rouayheb, D. Heinlein, and D. Karpuk, “Degree tables for secure distributed matrix multiplication,” in 2019 IEEE Information Theory Workshop (ITW) , 2019, pp. 1–5
2019
Closest in time.
M. Aliasgari, O. Simeone, and J. Kliewer, “Distributed and private coded matrix computation with flexible communication load,” arXiv preprint , vol. 1901.07705, 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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
Cited alongside, same era.
Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding,” arXiv preprint , vol. 1801.07487, 2018
2018
Cited alongside, same era.
W.-T. Chang and R. Tandon, “On the Capacity of Secure Distributed Matrix Multiplication,” 2018 IEEE Global Communications Conference (GLOBECOM) , pp. 1–6, 2018
2018
Cited alongside, same era.
J. Kakar, S. Ebadifar, and A. Sezgin, “Rate-Efficiency and Straggler-Robustness through Partition in Distributed Two-Sided Secure Matrix Computation,” arXiv preprint , vol. 1810.13006, 2018
2018
Cited alongside, same era.
R. G. L. D’Oliveira, S. E. Rouayheb, and D. A. Karpuk, “GASP Codes for Secure Distributed Matrix Multiplication,” arXiv preprint , vol. 1812.09962, 2018
2018
Cited alongside, same era.
J. Kakar, A. Alameer, A. Chaaban, A. Sezgin, and A. Paulraj, “Delivery Time Minimization in Edge Caching: Synergistic Benefits of Subspace Alignment and Zero Forcing,” in International Conference on Communications , May 2018, pp. 1–6
2018
Cited alongside, same era.
[Online]. Available: https://github.com/columbkh/Distributed_matrix_multiplication_schemes
Cited in the paper.
2019
Closest in time.
W. Chang and R. Tandon, “On the Upload versus Download Cost for Secure and Private Matrix Multiplication,” arXiv preprint , vol. 1906.10684, 2019
2019
Closest in time.
Z. Jia and S. A. Jafar, “X-secure T-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers,” arXiv preprint , vol. 1908.10854, 2019
2019
Closest in time.
S. Ebadifar, J. Kakar, and A. Sezgin, “The need for alignment in rate-efficient distributed two-sided secure matrix computation,” in IEEE International Conference on Communications , May 2019, pp. 1–6
2019
Closest in time.
Z. Jia, H. Sun, and S. A. Jafar, “Cross Subspace Alignment and the Asymptotic Capacity of X X -Secure T T -Private Information Retrieval,” IEEE Transactions on Information Theory , vol. 65, no. 9, pp. 5783–5798, Sep. 2019
2019
Closest in time.
Z. Jia and S. A. Jafar, “Cross Subspace Alignment Codes for Coded Distributed Batch Matrix Multiplication,” arXiv preprint , vol. 1909.13873, 2019
2019
Closest in time.
R. G. L. D’Oliveira, S. E. Rouayheb, D. Heinlein, and D. Karpuk, “Notes on communication and computation in secure distributed matrix multiplication,” arXiv preprint , vol. 2001.05568, 2020
2020
Closest in time.