Oblivious Stash Shuffle

By Petros Maniatis, Ilya Mironov, Kunal Talwar. 2017

This is a companion report to Bittau et al. We restate and prove security of the Stash Shuffle.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Badih Ghazi
2. Ú. Erlingsson
3. Peter Kairouz
4. Albert Cheu
5. Ilya Mironov
6. Borja Balle
7. Andrea Bittau
8. Ananth Raghunathan

Citations in the corpus

• Prochlo: Strong Privacy for Analytics in the Crowd (2017, background): “The security analysis for a choice of N , B, C, S, and W determines the security parameter , which indirectly reflects the fraction of infeasible permutations [50].”
• PROCHLO: Strong Privacy for Analytics in the Crowd (2017, background): “The security analysis for a choice of N , B, C, S, and W determines the security parameter , which indirectly reflects the fraction of infeasible permutations [50].”