2 papers
cs.CR2026
Lower Bounds for PIR with Preprocessing from Blackbox Cryptography
Alexander Hoover, Giuseppe Persiano, Kevin Yeo
Single-server private information retrieval (PIR) schemes are known to require linear query time. Recent works circumvent these classical lower bounds by leveraging preprocessing t…
cs.CR2025
Differentially Private Set Representations
Sarvar Patel, Giuseppe Persiano, Joon Young Seo +1
We study the problem of differentially private (DP) mechanisms for representing sets of size from a large universe. Our first construction creates -DP representations wi…