Lecturer: Salim El Rouayheb

hosted by Professor Randall Berry

We 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 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. We also derive lower bounds and prove that GASP codes are optimal in certain regimes.

This is a joint work with Rafael D'Oliveira, Daniel Heinlein and David Karpuk.

Salim El Rouayheb is the A. Walter Tyson assistant professor in the ECE Department at Rutgers University. From 2013 to 2017, he was an assistant professor at the ECE Department at the Illinois Institute of Technology, Chicago. He was a research scholar at the EE Department at Princeton University (2012-2013) and a postdoc at the EECS department at the University of California, Berkeley (2010-2011). He received his Ph.D. degree in electrical engineering from Texas A&M University, College Station, in 2009. He received the Google Faculty Award in 2018 and the NSF CAREER award in 2016. His research interests lie in the area of information theoretic security and privacy for data in distributed systems.