190 citations · 190 across the 2 of their papers we have counts for
3 papers
cs.CR2019
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…
cs.CR2017
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…
cs.CR2016★ 190 cited
Practical Secure Aggregation for Federated Learning on User-Held Data
Keith Bonawitz, Vladimir Ivanov, Ben Kreuter +6
Secure Aggregation protocols allow a collection of mutually distrust parties, each holding a private value, to collaboratively compute the sum of those values without revealing the…