Don't be Dense: Efficient Keyword PIR for Sparse Databases

ePrint Report: Don't be Dense: Efficient Keyword PIR for Sparse Databases

Sarvar Patel, Joon Young Seo, Kevin Yeo

In this paper, we introduce $\mathsf{SparsePIR}$, a single-server keyword private information retrieval (PIR) construction that enables querying over sparse databases. At its core, $\mathsf{SparsePIR}$ is based on a novel encoding algorithm that encodes sparse database entries as linear combinations while being compatible with important PIR optimizations including recursion. $\mathsf{SparsePIR}$ achieves response overhead that is half of state-of-the art keyword PIR schemes without …

algorithm art client construction database databases don encoding eprint report important information kevin novel private recursion report response seo server single state storage young