The problem of private information retrieval (PIR) from coded storage systems with colluding,
Byzantine, and unresponsive servers is considered. An explicit scheme using an [n, k] Reed …

Private information retrieval (PIR) allows a user to retrieve a desired message from a set of
databases without revealing the identity of the desired message. The replicated database …

Information-theoretic formulations of the private information retrieval (PIR) problem have
been investigated under a variety of scenarios. Symmetric private information retrieval …

We study the private information retrieval (PIR) problem under arbitrary collusion patterns for
replicated databases. We find a general characterization of the PIR capacity, which is the …

We consider the problem of noisy private information retrieval (NPIR) from non-
communicating databases, each storing the same set of messages. In this model, the …

We study the symmetric private information retrieval (SPIR) problem under arbitrary
collusion and eavesdropping patterns for replicated databases. We find its capacity, which is …

We consider the problem of designing private information retrieval (PIR) schemes on data of
m files replicated on n servers that can possibly collude. We focus on devising robust PIR …

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 …

In this work, we investigate the capacity of private information retrieval (PIR) from N
replicated databases, where a subset of the databases are byzantine. We allow for multi …

We study the private information retrieval (PIR) problem under arbitrary collusion patterns for
replicated databases. We find its capacity, which is the same as the capacity of the original …