Paper 2023/1574
Efficient Pre-processing PIR Without Public-Key Cryptography
Abstract
Classically, Private Information Retrieval (PIR) was studied in a setting without any pre-processing. In this setting, it is well-known that 1) public-key cryptography is necessary to achieve
non-trivial (i.e., sublinear) communication efficiency in the single-server setting, and 2) the total server computation
per query must be linear in the size of the database, no matter in the single-server or multi-server setting. Recent works have shown that both of these barriers can be overcome if we are willing to introduce a pre-processing phase. In particular, a recent work called Piano showed that using only one-way functions, one can construct a single-server preprocessing PIR with
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in EUROCRYPT 2024
- Keywords
- PIRPrivate Information Retrieval
- Contact author(s)
-
aghoshal @ andrew cmu edu
mingxunz @ andrew cmu edu
runting @ gmail com - History
- 2024-03-12: revised
- 2023-10-11: received
- See all versions
- Short URL
- https://ia.cr/2023/1574
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1574, author = {Ashrujit Ghoshal and Mingxun Zhou and Elaine Shi}, title = {Efficient Pre-processing {PIR} Without Public-Key Cryptography}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1574}, year = {2023}, url = {https://eprint.iacr.org/2023/1574} }