We introduce the problem of private computation, comprised of N distributed and non-
colluding servers, K independent datasets, and a user who wants to compute a function of …

Private computation is a generalization of private information retrieval, in which a user is
able to compute a function on a distributed dataset without revealing the identity of that …

The private search problem is introduced, where a dataset comprised of L iid records is
replicated across N non-colluding servers, and a user wishes to search for all records that …

In distributed computing system for the master-worker framework, an erasure code is able to
mitigate the effects of slow workers, also called stragglers. The distributed computing system …

We consider the problem of private information retrieval (PIR), where a single user with
private side information (PSI) aims to retrieve multiple files from a library stored at some …

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

Private computation in a distributed storage system (DSS) is a generalization of the private
information retrieval (PIR) problem. In such a setting, a user wishes to compute a function of …

In this paper, we introduce the problem of private sequential function computation, where a
user wishes to compute a composition of a sequence of K linear functions, in a specific …

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

This paper introduces the problem of Private Linear Transformation (PLT) which generalizes
the problems of private information retrieval and private linear computation. The PLT …