6 papers · 1 filter
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…
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…
Cuckoo Hashing in Cryptography: Optimal Parameters, Robustness and Applications
Kevin Yeo
Cuckoo hashing is a powerful primitive that enables storing items using small space with efficient querying. At a high level, cuckoo hashing maps items into entries storing…
SoK: SCT Auditing in Certificate Transparency
Sarah Meiklejohn, Joe DeBlasio, Devon O'Brien +3
The Web public key infrastructure is essential to providing secure communication on the Internet today, and certificate authorities play a crucial role in this ecosystem by issuing…
What Storage Access Privacy is Achievable with Small Overhead?
Sarvar Patel, Giuseppe Persiano, Kevin Yeo
Oblivious RAM (ORAM) and private information retrieval (PIR) are classic cryptographic primitives used to hide the access pattern to data whose storage has been outsourced to an un…
CacheShuffle: An Oblivious Shuffle Algorithm Using Caches
Sarvar Patel, Giuseppe Persiano, Kevin Yeo
We consider Oblivious Shuffling and K-Oblivious Shuffling, a refinement thereof. We provide efficient algorithms for both and discuss their application to the design of Oblivious R…