# Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits

arXiv: https://arxiv.org/abs/1712.07021 · HTML: https://mlsanity.com/paper/1712.07021/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Dec 2017.

## Built on by (most cited first, 1 of 1)

- [Single-Server Private Linear Transformation: The Joint Privacy Case](https://mlsanity.com/paper/2106.05220/) (2021)

## Abstract (arXiv)

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 r of the symbols from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the user privately downloads the desired message. In the prefetching phase, the user receives fracrN uncoded fraction of each message from the nth database. This side information is known only to the nth database and unknown to the remaining databases, i.e., the user possesses partially known side information. We investigate the optimal normalized download cost D^*(r) in the retrieval phase as a function of K, N, r. We develop lower and upper bounds for the optimal download cost. The bounds match in general for the cases of very low caching ratio (r ≤ frac1NK-1) and very high caching ratio (r ≥ fracK-2N2-3N+KN). We fully characterize the optimal download cost caching ratio tradeoff for K=3. For general K, N, and r, we show that the largest gap between the achievability and the converse bounds is frac532.