The notion of a Private Information Retrieval (PIR) code was recently introduced by Fazeli,
Vardy and Yaakobi [1] who showed that this class of codes permit PIR at reduced levels of …

It was recently shown by Fazeli et al. that the storage overhead of a traditional $ t $-server
private information retrieval (PIR) protocol can be significantly reduced using the concept of …

In this work private information retrieval (PIR) codes are studied. In ak-PIR code, s
information bits are encoded in such a way that every information bit has k mutually disjoint …

This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. In this work, a flexible
and robust private information retrieval (PIR) scheme based on binary non-maximum …

Private Information Retrieval (PIR) array codes were introduced by Fazeli et al.(2015) to
reduce the storage overhead in designing PIR protocols. Blackburn and Etzion (2017) …

We propose a new capacity-achieving code for the private information retrieval (PIR)
problem, and show that it has the minimum message size (being one less than the number …

In a private information retrieval (PIR) system, the user needs to retrieve one of the possible
messages from a set of storage servers, but wishes to keep the identity of the requested …

Private information retrieval (PIR) schemes for coded storage with colluding servers are
presented, which are not restricted to maximum distance separable (MDS) codes. PIR …

There has been much recent interest in Private information Retrieval (PIR) in models where
a database is stored across several servers using coding techniques from distributed …

Private Information Retrieval (PIR) problem has recently attracted a significant interest in the
information-theory community. In this problem, a user wants to privately download one or …