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 …

In this paper, we study the problem of private and secure distributed matrix multiplication
(PSDMM), where a user having a private matrix and non-colluding servers sharing a library …

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 …

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 consider the problem of evaluating arbitrary multivariate polynomials over a massive
dataset, in a distributed computing system with a master node and multiple worker nodes …

We study two problems of private matrix multiplication, over a distributed computing system
consisting of a master node, and multiple servers that collectively store a family of public …

We consider the problem of communication efficient secure distributed matrix multiplication.
The previous literature has focused on reducing the number of servers as a proxy for …

The problem of Multi-user Blind-secure-colluding Symmetric Private Information Retrieval
from Maximum Distance Separable (MDS) coded storage system with Byzantine and …

Multi-party computation (MPC) is promising for designing privacy-preserving machine
learning algorithms at edge networks. An emerging approach is coded-MPC (CMPC), which …

We study the secure distributed matrix multiplication (SDMM) problem under arbitrary
collusion pattern. In the one-sided SDMM problem, where only one matrix of the matrix …