PIR with Client-Side Preprocessing: Information-Theoretic Constructions and Lower Bounds

ePrint Report: PIR with Client-Side Preprocessing: Information-Theoretic Constructions and Lower Bounds

Yuval Ishai, Elaine Shi, Daniel Wichs

It is well-known that classical Private Information Retrieval (PIR) schemes without preprocessing must suffer from linear server computation per query. Moreover, any such single-server PIR with sublinear bandwidth must rely on public-key cryptography. Several recent works showed that these barriers pertaining to classical PIR can be overcome by introducing a preprocessing phase where each client downloads a small hint that helps it make …

bandwidth client client-side computation cryptography daniel eprint report information key linear private public public-key cryptography query report server shi single well-known