Multi-server doubly efficient PIR in the classical model and beyond
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1754644 (Why is no real title available?)
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
- 3-party distributed ORAM from oblivious set membership
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
- Can we access a database both locally and privately?
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Distributed Oblivious RAM for Secure Two-Party Computation
- Distributed Point Functions and Their Applications
- Fast multivariate multipoint evaluation over all finite fields
- Fast polynomial factorization and modular composition
- Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
- Function secret sharing
- How to share a secret
- Locally decodable codes and private information retrieval schemes.
- Near-optimal private information retrieval with preprocessing
- Oblivious message retrieval
- On algebraic homomorphic encryption and its applications to doubly-efficient PIR
- On the Lambert \(w\) function
- Optimal single-server private information retrieval
- Path ORAM
- Plinko: single-server PIR with efficient updates via invertible PRFs
- 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
- Robust information-theoretic private information retrieval
- Single-server client preprocessing PIR with tight space-time trade-off
- Single-server private information retrieval with sublinear amortized time
- Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption
- Software protection and simulation on oblivious RAMs
- Three-party ORAM for secure computation
- Towards 3-query locally decodable codes of subexponential length
- Towards practical doubly-efficient private information retrieval
- Two-server distributed ORAM with sublinear computation and constant rounds
- Verifiable single-server private information retrieval from LWE with binary errors
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
This page was built for publication: Multi-server doubly efficient PIR in the classical model and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233248)
