Technical Program

Paper Detail

Paper Title Distributed and Private Coded Matrix Computation with Flexible Communication Load
Paper IdentifierTU3.R5.1
Authors Malihe Aliasgari, New Jersey Institute of Technology, United States; Osvaldo Simeone, King's College London, United Kingdom; Joerg Kliewer, New Jersey Institute of Technology, United States
Session Private Computation I
Location Saint Victor, Level 3
Session Time Tuesday, 09 July, 14:30 - 16:10
Presentation Time Tuesday, 09 July, 14:30 - 14:50
Manuscript  Click here to download the manuscript
Abstract Tensor operations, such as matrix multiplication, are central to large-scale machine learning applications. These operations can be carried out on a distributed computing platform with a master server at the user side and multiple workers in the cloud operating in parallel. For distributed platforms, it has been recently shown that coding over the input data matrices can reduce the computational delay, yielding a tradeoff between recovery threshold and communication load. In this work, we impose an additional security constraint on the data matrices and assume that workers can collude to eavesdrop on the content of these data matrices. Specifically, we introduce a novel class of secure codes, referred to as secure generalized PolyDot codes, that generalizes previously published non-secure versions of these codes for matrix multiplication. These codes extend the state-of-the-art by allowing a flexible trade-off between recovery threshold and communication load for a fixed maximum number of colluding workers.