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

PIR with Client-Side Preprocessing: Information-Theoretic Constructions and Lower Bounds

Yuval Ishai, Elaine Shi, Daniel Wichs

Published Jan 1, 2024• 6 citations
Publisher
DOI
10.1007/978-3-031-68400-5_5

Related papers

Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing

Amos Beimel, Yuval Ishai, Tal Malkin

Journal of Cryptology•Feb 26, 2004•82 citations

A tight lower bound for restricted pir protocols

Richard Beigel, Lance Fortnow, William I. Gasarch

Computational Complexity•Apr 25, 2006•25 citations

On Quantum Advantage in Information Theoretic Single-Server PIR

Dorit Aharonov, Zvika Brakerski, Kai-Min Chung +3 more

Lecture notes in computer science•Jan 1, 2019•18 citations

Lower-Bounds on Public-Key Operations in PIR

Jesko Dujmovic, Mohammad Hajiabadi

Lecture notes in computer science•Jan 1, 2024•3 citations

Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing

Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen

Lecture notes in computer science•Jan 1, 2019•18 citations

Converse Bounds for Sun-Jafar-type Weak PIR under Mutual Information Leakage

Chandan Anand, Jayesh Seshadri, Prasad Krishnan +1 more

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations