Codes for Secure Distributed Matrix Multiplication

Add to your list(s) Download to your calendar using vCal

• Salim El-Rouayheb, Rutgers University
• Tuesday 28 May 2019, 11:00-12:00
• Room 909B, Electrical and Electronic Engineering.

If you have a question about this talk, please contact Joan P O'Brien.

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 joint work with Rafael D’Oliveira, Daniel Heinlein and David Karpuk.

This talk is part of the Featured talks series.

This talk is included in these lists:

• Andrea Picciau's list
• COMMSP & CP list
• COMMSP Seminar
• Featured talks
• Room 909B, Electrical and Electronic Engineering
• SAP Talks

Note that ex-directory lists are not shown.