Paper 2024/482

$\textsf{ThorPIR}$: Single Server PIR via Homomorphic Thorp Shuffles

Ben Fisch, Yale University
Arthur Lazzaretti, Yale University
Zeyu Liu, Yale University
Charalampos Papamanthou, Yale University
Abstract

Private Information Retrieval (PIR) is a two player protocol where the client, given some query $x \in [N]$, interacts with the server, which holds a $N$-bit string $\textsf{DB}$, in order to privately retrieve $\textsf{DB}[x]$. In this work, we focus on the single-server client-preprocessing model, initially proposed by Corrigan-Gibbs and Kogan (EUROCRYPT 2020), where the client and server first run a joint preprocessing algorithm, after which the client can retrieve elements from $\textsf{DB}$ privately in time sublinear in $N$. Most known constructions of single-server client-preprocessing PIR follow one of two paradigms: They feature either (1) a linear-bandwidth offline phase where the client downloads the whole database from the server, or (2) a sublinear-bandwidth offline phase where however the server has to compute a large-depth ($\Omega_\lambda (N)$) circuit under fully-homomorphic encryption (FHE) in order to execute the preprocessing phase. In this paper, we propose $\textsf{ThorPIR}$, a single-server client preprocessing PIR scheme which achieves both sublinear offline bandwidth (asymptotically and concretely) and a low-depth, highly parallelizable preprocessing circuit. Our main insight is to use and significantly optimize the concrete circuit-depth of a much more efficient shuffling technique needed during preprocessing, called Thorp shuffle. A Thorp shuffle satisfies a weaker security property (e.g., compared to an AES permutation) which is ``just enough'' for our construction. We estimate that with a powerful server (e.g., hundreds of thousands of GPUs), $\textsf{ThorPIR}$'s end-to-end preprocessing time is faster than any prior work. Additionally, compared to prior FHE-based works with sublinear bandwidth, our construction is at least around $10,000$ times faster.

Note: 12/09/24: Editorial changes. Include a discussion on FHE-friendly block-ciphers and other minor editorial changes. 06/04/24: Editorial changes. Include new benchmarks, detailed estimation, and conjectured security.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Major revision. CCS 2024
Keywords
Private Information RetrievalThorp Shuffle
Contact author(s)
benjamin fisch @ yale edu
arthur lazzaretti @ yale edu
zeyu liu @ yale edu
charalampos papamanthou @ yale edu
History
2024-12-09: last of 3 revisions
2024-03-23: received
See all versions
Short URL
https://ia.cr/2024/482
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/482,
      author = {Ben Fisch and Arthur Lazzaretti and Zeyu Liu and Charalampos Papamanthou},
      title = {$\textsf{{ThorPIR}}$: Single Server {PIR} via Homomorphic Thorp Shuffles},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/482},
      year = {2024},
      url = {https://eprint.iacr.org/2024/482}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.