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

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

Ethan Mook

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.17760/d20854530

Related papers

Towards Practical Doubly-Efficient Private Information Retrieval

Hiroki Okada, Rachel Player, Simon Pohmann +1 more

Lecture notes in computer science•Jan 1, 2025•9 citations

Lower Bounds for Communication Complexity of Private Information Retrieval

利哉 伊東, Toshiya Itoh

•Jan 1, 2000•0 citations

Doubly Efficient Private Information Retrieval and Fully Homomorphic Ram Computation from Ring LWE

Wei-Kai Lin, Ethan Mook, Daniel Wichs

SIAM Journal on Computing•Mar 5, 2026•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

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

Improved upper bounds on information-theoretic private information retrieval

Yuval Ishai

•Jan 1, 1999•39 citations