Salim El Rouayheb, Rutgers University

Abstract

I will talk about  the problem of Secure Distributed Matrix Multiplication (SDMM) in which a user wishes to compute the product of two matrices using the assistance  of honest but curious workers. In our recent work, we  linked code constructions for SDMM with low communication cost to a new combinatorial object that we call Additive Degree Table (ADT).  By studying ADTs, we  devise a new parametrized family of codes for SDMM that we call GASP (Gap Additive Secure Polynomial) Codes. I will also talk about lower bounds and when GASP codes are optimal. I will conclude with some related open problems. This is a joint work with Rafael D'Oliveira, Daniel Heinlein and David Karpuk.