8 citations · 24 across the 11 of their papers we have counts for
13 papers
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds
Amos Beimel, Haim Kaplan, Yishay Mansour +3
A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm. We obtain…
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis +1
In his seminal work, Cleve [STOC '86] has proved that any -round coin-flipping protocol can be efficiently biased by . This lower bound was met for the two-party case by…
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…
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…
The power of synergy in differential privacy: Combining a small curator with local randomizers
Amos Beimel, Aleksandra Korolova, Kobbi Nissim +2
Motivated by the desire to bridge the utility gap between local and trusted curator models of differential privacy for practical applications, we initiate the theoretical study of…
Exploring Differential Obliviousness
Amos Beimel, Kobbi Nissim, Mohammad Zaheri
In a recent paper Chan et al. [SODA '19] proposed a relaxation of the notion of (full) memory obliviousness, which was introduced by Goldreich and Ostrovsky [J. ACM '96] and extens…