Information-theoretic multi-server private information retrieval with client preprocessing
From MaRDI portal
Cites work
- 2-server PIR with subpolynomial communication
- 3-query locally decodable codes of subexponential length
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- Batch codes and their applications
- Combinatorial batch codes
- Computationally private information retrieval with polylogarithmic communication
- Distributed Point Functions and Their Applications
- Efficient pre-processing PIR without public-key cryptography
- Function secret sharing
- Information-theoretic private information retrieval: A unified construction (extended abstract)
- One-way functions are essential for single-server private information retrieval
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Private information retrieval
- Private information retrieval with sublinear online time
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Reducing the servers computation in private information retrieval: PIR with preprocessing
- Single-server private information retrieval with sublinear amortized time
- Towards 3-query locally decodable codes of subexponential length
- Trapdoor hash functions and their applications
This page was built for publication: Information-theoretic multi-server private information retrieval with client preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955259)