PIR with client-side preprocessing: information-theoretic constructions and lower bounds
From MaRDI portal
Publication:6653044
DOI10.1007/978-3-031-68400-5_5MaRDI QIDQ6653044
Yuval Ishai, Daniel Wichs, Elaine Shi
Publication date: 13 December 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- Towards doubly efficient private information retrieval
- On distributional collision resistant hashing
- Private information retrieval with sublinear online time
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Single-server private information retrieval with sublinear amortized time
- On the complexity of collision resistant hash functions: new and old black-box separations
- On Basing Private Information Retrieval on NP-Hardness
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- Oblivious RAMs without cryptogrpahic assumptions
- 2-Server PIR with Sub-Polynomial Communication
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Perfectly Secure Oblivious RAM without Random Oracles
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Secret key agreement by public discussion from common information
- Software protection and simulation on oblivious RAMs
- Structure Versus Hardness Through the Obfuscation Lens
- An Equivalence Between Zero Knowledge and Commitments
- Information Security
- Theory of Cryptography
- Automata, Languages and Programming
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- An Unconditional Study of Computational Zero Knowledge
- Lower bounds for (batch) PIR with private preprocessing
- Information-theoretic distributed point functions
- Efficient pre-processing PIR without public-key cryptography
This page was built for publication: PIR with client-side preprocessing: information-theoretic constructions and lower bounds
