Private information retrieval: share conversions vs decoding polynomials
From MaRDI portal
Cites work
- 2-server PIR with sub-polynomial communication
- 3-query locally decodable codes of subexponential length
- Advances in Cryptology - EUROCRYPT 2004
- Breaking the \(O(n^{1/(2k-1)})\) barrier for information-theoretic private information retrieval
- Fourier sparsity of delta functions and matching vector PIRs
- General constructions for information-theoretic private information retrieval
- scientific article; zbMATH DE number 5485460 (Why is no real title available?)
- scientific article; zbMATH DE number 3910296 (Why is no real title available?)
- Multiple assignment scheme for sharing secret
- On the Cryptographic Complexity of the Worst Functions
- On the efficiency of local decoding procedures for error-correcting codes
- Private information retrieval
- Query-efficient locally decodable codes of subexponential length
- Share conversion, pseudorandom secret-sharing and applications to secure computation
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Upper bound on the communication complexity of private information retrieval
This page was built for publication: Private information retrieval: share conversions vs decoding polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447177)