8 citations · 24 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
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…
cs.CR2021
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…