Pages that link to "Item:Q4571971"
From MaRDI portal
The following pages link to Upper bound on the communication complexity of private information retrieval (Q4571971):
Displaying 16 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- Enhancing user privacy in SARG04-based private database query protocols (Q898465) (← links)
- An optimal lower bound for 2-query locally decodable linear codes (Q1045948) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity (Q2286752) (← links)
- Quantum symmetrically-private information retrieval (Q2390235) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
