The Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model

29 March 2021

Papers citing "The Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model"

3 / 3 papers shown

Title
Private Aggregation from Fewer Anonymous Messages Badih Ghazi Pasin Manurangsi Rasmus Pagh A. Velingker FedML 42 55 0 24 Sep 2019
Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity Ulfar Erlingsson Vitaly Feldman Ilya Mironov A. Raghunathan Kunal Talwar Abhradeep Thakurta 141 420 0 29 Nov 2018
Prochlo: Strong Privacy for Analytics in the Crowd Andrea Bittau Ulfar Erlingsson Petros Maniatis Ilya Mironov A. Raghunathan David Lie Mitch Rudominer Ushasree Kode J. Tinnés B. Seefeld 88 278 0 02 Oct 2017