Paper 2023/452
Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation
Abstract
We construct a sublinear-time single-server pre-processing Private Information Retrieval
(PIR) scheme with optimal client storage and server computation (up to poly-logarithmic factors), only relying on the assumption of the existence of One Way Functions (OWF). Our scheme achieves amortized
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. IEEE S&P 2024
- Keywords
- PIR
- Contact author(s)
-
mingxunz @ andrew cmu edu
andrewpark @ cmu edu
runting @ cs cmu edu
wenting @ cmu edu - History
- 2023-11-12: last of 3 revisions
- 2023-03-28: received
- See all versions
- Short URL
- https://ia.cr/2023/452
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/452, author = {Mingxun Zhou and Andrew Park and Elaine Shi and Wenting Zheng}, title = {Piano: Extremely Simple, Single-Server {PIR} with Sublinear Server Computation}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/452}, year = {2023}, url = {https://eprint.iacr.org/2023/452} }