IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

On Lower Bounds for the Communication Complexity of Private Information Retrieval

Toshiya Itoh

Published Jan 1, 2001• 16 citations

Related papers

Lower Bounds for Communication Complexity of Private Information Retrieval

利哉伊東, Toshiya Itoh

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval

Iftach Haitner, Jonathan J. Hoch, Gil Segev

Upper bound on the communication complexity of private information retrieval

Andris Ambainis

Doubly efficient private information retrieval: construction, applications and lower bounds

Ethan Mook

Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval

Stephanie Wehner, Ronald de Wolf

Quantum Private Information Retrieval has Linear Communication Complexity

Ämin Baumeler, Anne Broadbent