Upper bound on the communication complexity of private information retrieval

Information storage and retrieval of data (68P20) Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Database theory (68P15)

Cites Work

Title not available (Why is that?)
Boolean Circuits, Tensor Ranks, and Communication Complexity
Title not available (Why is that?)
Title not available (Why is that?)
On hiding information from an oracle
Simultaneous messages vs. communication
Title not available (Why is that?)
Title not available (Why is that?)
Modified ranks of tensors and the size of circuits
Upper bounds on multiparty communication complexity of shifts

Cited In (21)

Quantum symmetrically-private information retrieval
On the optimal communication complexity of error-correcting multi-server PIR
Lower bounds for (batch) PIR with private preprocessing
Enhancing user privacy in SARG04-based private database query protocols
Short locally testable codes and proofs: a survey in two parts
Communication-efficient distributed oblivious transfer
Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols
Short locally testable codes and proofs
Single-server private information retrieval with sublinear amortized time
Lower bounds for adaptive locally decodable codes
Private information retrieval with sublinear online time
Verifiable single-server private information retrieval from LWE with binary errors
An optimal lower bound for 2-query locally decodable linear codes
Query-efficient locally decodable codes of subexponential length
Exponential lower bound for 2-query locally decodable codes via a quantum argument
General constructions for information-theoretic private information retrieval
Protecting data privacy in private information retrieval schemes
Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity
On query-to-communication lifting for adversary bounds
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
On locally decodable codes, self-correctable codes, and \(t\)-private PIR

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)