8 citations · 24 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CR2020
On the Round Complexity of the Shuffle Model
Amos Beimel, Iftach Haitner, Kobbi Nissim +1
The shuffle model of differential privacy was proposed as a viable model for performing distributed differentially private computations. Informally, the model consists of an untrus…
cs.LG2020★ 4 cited
Closure Properties for Private Classification and Online Prediction
Noga Alon, Amos Beimel, Shay Moran +1
Let~$\cH$ be a class of boolean functions and consider a {\it composed class} $\cH'$ that is derived from~$\cH$ using some arbitrary aggregation rule (for example, $\cH'$ may be th…