Upper bound on the communication complexity of private information retrieval
From MaRDI portal
Publication:4571971
Cites work
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 4213418 (Why is no real title available?)
- scientific article; zbMATH DE number 3915608 (Why is no real title available?)
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Boolean Circuits, Tensor Ranks, and Communication Complexity
- Modified ranks of tensors and the size of circuits
- On hiding information from an oracle
- Simultaneous messages vs. communication
- Upper bounds on multiparty communication complexity of shifts
Cited in
(21)- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Short locally testable codes and proofs
- Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols
- Enhancing user privacy in SARG04-based private database query protocols
- Communication-efficient distributed oblivious transfer
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
- Lower bounds for adaptive locally decodable codes
- An optimal lower bound for 2-query locally decodable linear codes
- On query-to-communication lifting for adversary bounds
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR
- Private information retrieval with sublinear online time
- Verifiable single-server private information retrieval from LWE with binary errors
- Quantum symmetrically-private information retrieval
- Query-efficient locally decodable codes of subexponential length
- Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity
- On the optimal communication complexity of error-correcting multi-server PIR
- Lower bounds for (batch) PIR with private preprocessing
- General constructions for information-theoretic private information retrieval
- Protecting data privacy in private information retrieval schemes
- Short locally testable codes and proofs: a survey in two parts
- Single-server private information retrieval with sublinear amortized time
This page was built for publication: Upper bound on the communication complexity of private information retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571971)
