Technical Program

Paper Detail

Paper Title GASP Codes for Secure Distributed Matrix Multiplication
Paper IdentifierTU3.R5.4
Authors Rafael Gregorio Lucas D'Oliveira, Salim El Rouayheb, Rutgers University, United States; David Karpuk, Universidad de los Andes, Colombia
Session Private Computation I
Location Saint Victor, Level 3
Session Time Tuesday, 09 July, 14:30 - 16:10
Presentation Time Tuesday, 09 July, 15:30 - 15:50
Manuscript  Click here to download the manuscript
Abstract 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 combinatorial problem on a special type of addition table, which we call the degree table. The codes are based on arithmetic progressions, and are thus named GASP (Gap Additive Secure Polynomial) Codes. GASP Codes are shown to outperform all previously known polynomial codes for secure distributed matrix multiplication in terms of download rate.