Paper 2024/829
Multi-Server Doubly Efficient PIR
Abstract
Doubly Efficient Private Information Retrieval (DEPIR) pertains to a Private Information Retrieval (PIR) scheme with both near-linear server-side preprocessing time and sublinear query time. Very recently, Lin et al. (STOC '23) devised the first single-server DEPIR scheme from standard assumptions. However, their work left one major question open: can we build a DEPIR scheme in the multi-server setting, without relying on heavy cryptographic machinery?
In this work, we propose the first doubly efficient information-theoretic PIR scheme, in the multi-server setting. For a database of size
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Information theoretic cryptographyPrivate Information Retrieval
- Contact author(s)
-
arthur lazzaretti @ yale edu
zeyu liu @ yale edu
benjamin fisch @ yale edu
charalampos papamanthou @ yale edu - History
- 2024-06-01: revised
- 2024-05-28: received
- See all versions
- Short URL
- https://ia.cr/2024/829
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/829, author = {Arthur Lazzaretti and Zeyu Liu and Ben Fisch and Charalampos Papamanthou}, title = {Multi-Server Doubly Efficient {PIR}}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/829}, year = {2024}, url = {https://eprint.iacr.org/2024/829} }