Private retrieval, computing, and learning: Recent progress and future challenges

S Ulukus, S Avestimehr, M Gastpar… - IEEE Journal on …, 2022 - ieeexplore.ieee.org
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 …

The capacity of private information retrieval from coded databases

K Banawan, S Ulukus - IEEE Transactions on Information …, 2018 - ieeexplore.ieee.org
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 …

The capacity of private information retrieval from Byzantine and colluding databases

K Banawan, S Ulukus - IEEE Transactions on Information …, 2018 - ieeexplore.ieee.org
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 …

Multi-message private information retrieval: Capacity results and near-optimal schemes

K Banawan, S Ulukus - IEEE Transactions on Information …, 2018 - ieeexplore.ieee.org
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 capacity of cache aided private information retrieval

R Tandon - 2017 55th Annual Allerton Conference on …, 2017 - ieeexplore.ieee.org
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 …

Fundamental limits of cache-aided private information retrieval with unknown and uncoded prefetching

YP Wei, K Banawan, S Ulukus - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
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 …

The Capacity of T-Private Information Retrieval With Private Side Information

Z Chen, Z Wang, SA Jafar - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
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 …

Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al.

H Sun, SA Jafar - IEEE Transactions on Information Theory, 2017 - ieeexplore.ieee.org
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 …

Cross Subspace Alignment and the Asymptotic Capacity of -Secure -Private Information Retrieval

Z Jia, H Sun, SA Jafar - IEEE Transactions on Information …, 2019 - ieeexplore.ieee.org
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 …

The capacity of private computation

H Sun, SA Jafar - IEEE Transactions on Information Theory, 2018 - ieeexplore.ieee.org
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 …