Springer eBooks

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

Iftach Haitner, Jonathan J. Hoch, Gil Segev

Published Feb 25, 2008• 12 citations

Related papers

On Lower Bounds for the Communication Complexity of Private Information Retrieval

Toshiya Itoh

Lower Bounds for Communication Complexity of Private Information Retrieval

利哉伊東, Toshiya Itoh

Upper bound on the communication complexity of private information retrieval

Andris Ambainis

Quantum Private Information Retrieval has Linear Communication Complexity

Ämin Baumeler, Anne Broadbent

Optimal Single-Server Private Information Retrieval

Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis +1 more

Verifiable Single-Server Private Information Retrieval

Xingfeng Wang, Liang Zhao