Lower bounds for (batch) PIR with private preprocessing
From MaRDI portal
Publication:6138100
DOI10.1007/978-3-031-30545-0_18MaRDI QIDQ6138100
Publication date: 16 January 2024
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for linear locally decodable codes and private information retrieval
- Random oracles and non-uniformity
- The Discrete Logarithm problem with preprocessing
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Yes, there is an oblivious RAM lower bound!
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Private information retrieval with sublinear online time
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Single-server private information retrieval with sublinear amortized time
- Stronger lower bounds for online ORAM
- Compressible FHE with applications to PIR
- Permuted puzzles and cryptographic hardness
- Combinatorial batch codes
- Lower bounds for differentially private RAMs
- Private anonymous data access
- One-way functions are essential for single-server private information retrieval
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- 2-Server PIR with Sub-Polynomial Communication
- Function Secret Sharing
- Matching Vector Codes
- Private information retrieval
- Towards 3-query locally decodable codes of subexponential length
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
- Batch codes and their applications
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Random Oracles and Auxiliary Input
- Upper bound on the communication complexity of private information retrieval
- Faster Online Matrix-Vector Multiplication
- 3-Query Locally Decodable Codes of Subexponential Length
- Lower Bounds for Oblivious Data Structures
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- The cell probe complexity of dynamic range counting
- Distributed Point Functions and Their Applications
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Automata, Languages and Programming
- Automata, Languages and Programming
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- Universal service-providers for private information retrieval
This page was built for publication: Lower bounds for (batch) PIR with private preprocessing
