We consider the problem of secure distributed matrix multiplication (SDMM) in which a user
wishes to compute the product of two matrices with the assistance of honest but curious …

Large matrix multiplications commonly take place in large-scale machine-learning
applications. Often, the sheer size of these matrices prevent carrying out the multiplication at …

We consider the problem of designing codes with flexible rate (referred to as rateless
codes), for private distributed matrix-matrix multiplication. A master server owns two private …

We consider the problem of designing secure and private codes for distributed matrix-matrix
multiplication. A master server owns two private matrices and hires worker nodes to help …

This paper investigates the problem of Secure Multi-party Batch Matrix Multiplication
(SMBMM), where a user aims to compute the pairwise products of two batch of massive …

We consider the problem of secure distributed matrix multiplication (SDMM), where a user
has two matrices and wishes to compute their product with the help of N honest but curious …

In this paper, a general framework for linear secure distributed matrix multiplication (SDMM)
is introduced. The model allows for a neat treatment of straggling and Byzantine servers via …

We consider the problems of Private and Secure Matrix Multiplication (PSMM) and Fully
Private Matrix Multiplication (FPMM), for which matrices privately selected by a master node …

We present Modular Polynomial (MP) Codes for Secure Distributed Matrix Multiplication
(SDMM). The construction is based on the observation that one can decode certain proper …

In this paper, we propose a novel construction for secure distributed matrix multiplication
(SDMM) based on algebraic geometry (AG) codes, which we call the PoleGap SDMM …