On arithmetic private information retrieval: why code-based PIR (usually) fails
From MaRDI portal
Cites work
- 2-server PIR with sub-polynomial communication
- Actively secure arithmetic computation and VOLE with constant computational overhead
- An \(\Omega (n^{1/3})\) lower bound for bilinear group based private information retrieval
- Arithmetic circuits: a survey of recent results and open questions
- Arithmetic cryptography
- Can we access a database both locally and privately?
- Cryptographic primitives based on hard learning problems
- Cryptography and Coding
- Distributed Point Functions and Their Applications
- Efficient multi-party computation over rings
- Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- General constructions for information-theoretic private information retrieval
- How to Garble Arithmetic Circuits
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 5009196 (Why is no real title available?)
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Low-complexity cryptographic hash functions
- Lower bounds for linear locally decodable codes and private information retrieval
- More on average case vs approximation complexity
- Oblivious transfer and polynomial evaluation
- On Secure Multi-party Computation in Black-Box Groups
- On the Existence of Pseudorandom Generators
- On the privacy of a code-based single-server computational PIR scheme
- Private information retrieval
- Replication is not needed: single database, computationally-private information retrieval
- Secure arithmetic computation with constant computational overhead
- Selective private function evaluation with applications to private statistics
- Shared generation of authenticators and signatures
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- Single server private information retrieval protocols with codes over rings
- Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
This page was built for publication: On arithmetic private information retrieval: why code-based PIR (usually) fails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447176)