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

Lecture notes in computer science

Upper bound on the communication complexity of private information retrieval

Andris Ambainis

Published Jan 1, 1997• 174 citations
Publisher
DOI
10.1007/3-540-63165-8_196

Related papers

Lower Bounds for Communication Complexity of Private Information Retrieval

利哉 伊東, Toshiya Itoh

•Jan 1, 2000•0 citations

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

Improved upper bounds on information-theoretic private information retrieval

Yuval Ishai

•Jan 1, 1999•39 citations

Quantum Private Information Retrieval has Linear Communication Complexity

Ämin Baumeler, Anne Broadbent

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

Upper and Lower Bounds on the Capacity of Private Information Retrieval Allowing Information Leakage from Queries with Different Limits for Each Database

Naoto Toyoda, Tetsunao Matsuta, Uyematsu Tomohiko

IEICE Technical Report; IEICE Tech. Rep.•Feb 25, 2021•0 citations