2-server PIR with sub-polynomial communication
From MaRDI portal
Cited in
(10)- Single server private information retrieval protocols with codes over rings
- Plinko: single-server PIR with efficient updates via invertible PRFs
- Efficient information-theoretic distributed point functions with general output groups
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- Cryptography with weak privacy
- Violating constant degree hypothesis requires breaking symmetry
- Information-theoretic random-index PIR
- Fourier sparsity of delta functions and matching vector PIRs
- On arithmetic private information retrieval: why code-based PIR (usually) fails
- Private information retrieval: share conversions vs decoding polynomials
This page was built for publication: 2-server PIR with sub-polynomial communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829053)