Most of our lives are conducted in the cyberspace. The human notion of privacy translates
into a cyber notion of privacy on many functions that take place in the cyberspace. This …

We consider the problem of private information retrieval (PIR) over a distributed storage
system. The storage system consists of N non-colluding databases, each storing an MDS …

We consider the problem of single-round private information retrieval (PIR) from N replicated
databases. We consider the case when B databases are outdated (unsynchronized), or …

We consider the problem of multi-message private information retrieval (MPIR) from N non-
communicating replicated databases. In MPIR, the user is interested in retrieving P …

The problem of cache enabled private information retrieval (PIR) is considered in which a
user wishes to privately retrieve one out of K messages, each of size L bits from N distributed …

We consider the problem of private information retrieval (PIR) from N non-colluding and
replicated databases when the user is equipped with a cache that holds an uncoded fraction …

We consider the problem of T-Private Information Retrieval with private side information
(TPIR-PSI). In this problem, N replicated databases store K independent messages, and a …

A (K, N, T, K c) instance of private information retrieval from MDS coded data with colluding
servers (in short, MDS-TPIR), is comprised of K messages and N distributed servers. Each …

In the robust secure aggregation problem, a server wishes to learn and only learn the sum of
the inputs of a number of users while some users may drop out (ie, may not respond). The …

X-secure and T-private information retrieval (XSTPIR) is a form of private information
retrieval where data security is guaranteed against collusion among up to X servers and the …