Towards doubly efficient private information retrieval
From MaRDI portal
Recommendations
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- scientific article; zbMATH DE number 1759771
- Verifiable multi-server private information retrieval
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Single-server private information retrieval with sublinear amortized time
Cited in
(44)- Can we access a database both locally and privately?
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Verifiable single-server private information retrieval from LWE with binary errors
- Private information retrieval with sublinear online time
- Two-server distributed ORAM with sublinear computation and constant rounds
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Single-server private information retrieval with sublinear amortized time
- Permuted puzzles and cryptographic hardness
- Robust information-theoretic private information retrieval
- Multi-client oblivious RAM with poly-logarithmic communication
- Private information retrieval with preprocessing based on the approximate GCD problem
- Fault-tolerant symmetrically-private information retrieval
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
- Another Look at Extended Private Information Retrieval Protocols
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
- scientific article; zbMATH DE number 2090941 (Why is no real title available?)
- Private Information Retrieval Over Gaussian MAC
- Verifiable multi-server private information retrieval
- A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
- Is there an oblivious RAM lower bound for online reads?
- Is there an oblivious RAM lower bound for online reads?
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- End-to-end secure messaging with traceability only for illegal content
- Collusion-resistant functional encryption for RAMs
- Optimal single-server private information retrieval
- Lower bounds for (batch) PIR with private preprocessing
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- On Private Information Retrieval Supporting Range Queries
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Lower-bounds on public-key operations in PIR
- Efficient pre-processing PIR without public-key cryptography
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Reusable online-efficient commitments
- Doubly efficient cryptography: commitments, arguments and RAM MPC
- Fully malicious authenticated PIR
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Linear-size Boolean circuits for multiselection
- Single-server client preprocessing PIR with tight space-time trade-off
- Black box crypto is useless for doubly efficient PIR
- On algebraic homomorphic encryption and its applications to doubly-efficient PIR
- Plinko: single-server PIR with efficient updates via invertible PRFs
- Towards practical doubly-efficient private information retrieval
- Laconic PSI on authenticated inputs and applications
- Two-server private information retrieval in sublinear time and quasilinear space
This page was built for publication: Towards doubly efficient private information retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690292)
