Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lower Bounds for Communication Complexity of Private Information Retrieval

利哉 伊東, Toshiya Itoh

Published Jan 1, 2000• 0 citations
OpenAlex

Related papers

On Lower Bounds for the Communication Complexity of Private Information Retrieval

Toshiya Itoh

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2001•16 citations

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

Iftach Haitner, Jonathan J. Hoch, Gil Segev

Springer eBooks•Feb 25, 2008•12 citations

Upper bound on the communication complexity of private information retrieval

Andris Ambainis

Lecture notes in computer science•Jan 1, 1997•174 citations

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

Ethan Mook

•Jan 1, 2026•0 citations

Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval

Stephanie Wehner, Ronald de Wolf

arXiv:quant-ph/0403140•Lecture notes in computer science•Jan 1, 2005•52 citations

Quantum Private Information Retrieval has Linear Communication Complexity

Ämin Baumeler, Anne Broadbent

arXiv:1304.5490•Journal of Cryptology•Apr 16, 2014•33 citations