Private information retrieval (PIR) protocols ensure that a user can download a file from a
database without revealing any information on the identity of the requested file to the servers …

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 private information retrieval (PIR), where a single user with
private side information (PSI) aims to retrieve multiple files from a library stored at some …

A private information retrieval (PIR) protocol guarantees that a user can privately retrieve
files stored in a database without revealing any information about the identity of the …

We consider the problem of private linear computation (PLC) in a distributed storage system.
In PLC, a user wishes to compute a linear combination of f messages stored in noncolluding …

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

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

In the conventional robust-colluding private information retrieval (PIR) system, the user
needs to retrieve one of the possible messages while keeping the identity of the requested …