11 citations · 11 across the 2 of their papers we have counts for
3 papers
On the Complexity of Fair Coin Flipping
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
A two-party coin-flipping protocol is -fair if no efficient adversary can bias the output of the honest party (who always outputs a bit, even if the other party aborts) by more…
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 Randomized Byzantine Agreement
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis +2
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds. In part…