This talk will consider 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 recent work, code constructions for SDMM with low communication cost were linked to a new combinatorial object that we call Additive Degree Table (ADT). By studying ADTs, we devise a new parametrised family of codes for SDMM that we call GASP (Gap Additive Secure Polynomial) Codes.
The talk will also consider the lower bounds and when GASP codes are optimal and conclude with some related open problems. This is joint work with Rafael D’Oliveira, Daniel Heinlein and David Karpuk.
About the speaker: Salim El Rouayheb is an assistant professor at ECE department at Rutgers University. He is a recipient of the Google Faculty Award (2018) and the National Science Foundation CAREER award (2016). He is interested in information and coding theoretic problems in data privacy and security.