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 …

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 …

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 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 …

The problem of-secure-colluding symmetric Private Polynomial Computation (PPC) from
coded storage system with Byzantine and unresponsive servers is studied in this paper …

Distributed linearly separable computation, where a user asks some distributed servers to
compute a linearly separable function, was recently formulated by the same authors and …

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

This work considers the problem of distributing matrix multiplication over the real or complex
numbers to helper servers, such that the information leakage to these servers is close to …