Degree Tables for Secure Distributed Matrix Multiplication

We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a recently introduced combinatorial tool called the degree table. Maximizing the download rate of a polynomial code for SDMM is equivalent to minimizing N, the number of distinct elements in the corresponding degree table. We propose new constructions of degree tables with a low number of distinct elements. These new constructions lead to a general family of polynomial codes for SDMM, which we call $GASP_{r}$ (Gap Additive Secure Polynomial codes) parametrized by an integer r. $GASP_{r}$ outperforms all previously known polynomial codes for SDMM. We also present lower bounds on N and show that $GASP_{r}$ achieves the lower bounds in the case of no server collusion.

[1]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[2]  Farzin Haddadpour,et al.  On the optimal recovery threshold of coded matrix multiplication , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  Jungwoo Lee,et al.  Secure Distributed Computing With Straggling Servers Using Polynomial Codes , 2019, IEEE Transactions on Information Forensics and Security.

[4]  A. Salman Avestimehr,et al.  A Fundamental Tradeoff Between Computation and Communication in Distributed Computing , 2016, IEEE Transactions on Information Theory.

[5]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[6]  Amir Salman Avestimehr,et al.  Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy , 2018, AISTATS.

[7]  Aydin Sezgin,et al.  Rate-Efficiency and Straggler-Robustness through Partition in Distributed Two-Sided Secure Matrix Computation , 2018, ArXiv.

[8]  Mohammad Ali Maddah-Ali,et al.  Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[9]  Ravi Tandon,et al.  On the Capacity of Secure Distributed Matrix Multiplication , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[10]  Mohammad Ali Maddah-Ali,et al.  Limited-Sharing Multi-Party Computation for Massive Matrix Operations , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[11]  David A. Karpuk,et al.  GASP Codes for Secure Distributed Matrix Multiplication , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).

[12]  Parimal Parag,et al.  Minimizing latency for secure distributed computing , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[13]  Alfred Geroldinger,et al.  Combinatorial Number Theory and Additive Group Theory , 2009 .

[14]  Mohammad Ali Maddah-Ali,et al.  Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication , 2017, NIPS.

[15]  Yaoqing Yang,et al.  An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation , 2018, 2018 IEEE International Conference on Big Data (Big Data).