Single-Server Client Preprocessing PIR with Tight Space-Time Trade-Off
- 28 April 2025
- book chapter
- Published by Springer Nature
- p. 94-122
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- TreePIR: Sublinear-Time and Polylog-Bandwidth Private Information Retrieval from DDH2023
- Optimal Single-Server Private Information Retrieval2023
- Lower Bounds for (Batch) PIR with Private Preprocessing2023
- Single-Server Private Information Retrieval with Sublinear Amortized Time2022
- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time2021
- Private Information Retrieval with Sublinear Online Time2020
- Single-Database Private Information Retrieval with Constant Communication Rate2005
- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing2000
- One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval2000
- Computationally Private Information Retrieval with Polylogarithmic Communication1999