PIR with client-side preprocessing: information-theoretic constructions and lower bounds
From MaRDI portal
Cites work
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- An Equivalence Between Zero Knowledge and Commitments
- An Unconditional Study of Computational Zero Knowledge
- Automata, Languages and Programming
- Efficient pre-processing PIR without public-key cryptography
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- scientific article; zbMATH DE number 5009196 (Why is no real title available?)
- scientific article; zbMATH DE number 5604104 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
- Information Security
- Information-theoretic distributed point functions
- Lower bounds for (batch) PIR with private preprocessing
- New realizations of somewhere statistically binding hashing and positional accumulators
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious RAMs without cryptogarphic assumptions
- On basing private information retrieval on NP-hardness
- On distributional collision resistant hashing
- On the communication complexity of secure function evaluation with long output
- On the complexity of collision resistant hash functions: new and old black-box separations
- Perfectly secure oblivious RAM without random oracles
- Private information retrieval with sublinear online time
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Secret key agreement by public discussion from common information
- Single-server private information retrieval with sublinear amortized time
- Software protection and simulation on oblivious RAMs
- Structure versus hardness through the obfuscation lens
- Theory of Cryptography
- Towards doubly efficient private information retrieval
Cited in
(4)- Pseudorandom functions with weak programming privacy and applications to private information retrieval
- Single-server client preprocessing PIR with tight space-time trade-off
- Information-theoretic multi-server private information retrieval with client preprocessing
- Two-server private information retrieval in sublinear time and quasilinear space
This page was built for publication: PIR with client-side preprocessing: information-theoretic constructions and lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653044)
