Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Research output: Contribution to journalArticlepeer-review


In his seminal work, Cleve [Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 364-369] has proved that any r-round coin-flipping protocol can be efficiently biased by Θ(1/r). This lower bound was met for the two-party case by Moran, Naor, and Segev [J. Cryptology, 29 (2016), pp. 491-513] and the three-party case (up to a polylog factor) by Haitner and Tsfadia [SIAM J. Comput., 46 (2017), pp. 479-542] and was approached for nparty protocols when n < loglog r by Buchbinder et al. [Proceedings of the 28th Annual ACMSIAM Symposium on Discrete Algorithms, 2017, pp. 2580-2600]. For n > loglog r, however, the best bias for n-party coin-flipping protocols remains O(n/ √ r) achieved by the majority protocol of Awerbuch et al. [How to implement Bracha's O(log n) Byzantine Agreement Algorithm, manuscript, 1985]. Our main result is a tighter lower bound on the bias of coin-flipping protocols, showing that, for every constant ϵ > 0, an rϵ-party r-round coin-flipping protocol can be efficiently biased by eΩ(1/ √ r). As far as we know, this is the first improvement of Cleve's bound and is only n = rϵ (multiplicative) far from the aforementioned upper bound of Awerbuch et al. We prove the above bound using two new results that we believe are of independent interest. The first result is that a sequence of ("augmented") weak martingales have large gap: with constant probability there exists two adjacent variables whose gap is at least the ratio between the gap between the first and last variables and the square root of the number of variables. This generalizes over the result of Cleve and Impagliazzo [Martingales, Collective Coin Flipping and Discrete Control Processes (Extended Abstract), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=, 1993], who showed that the above holds for strong martingales, and allows in some setting to exploit this gap by efficient algorithms. We prove the above using a novel argument that does not follow the more complicated approach of R. Cleve and R. Impagliazzo. The second result is a new sampling algorithm that uses a differentially private mechanism to minimize the effect of data divergence.

Original languageEnglish
Article number4
Pages (from-to)1126-1171
Number of pages46
JournalSIAM Journal on Computing
Issue number4
StatePublished - 21 Jul 2022


  • augmented weak martingales
  • coin-flipping
  • differential privacy
  • multiparty computation
  • oblivious sampling

ASJC Scopus subject areas

  • Computer Science (all)
  • Mathematics (all)


Dive into the research topics of 'Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.'. Together they form a unique fingerprint.

Cite this