Adaptively Secure Coin-Flipping, Revisited

@inproceedings{Goldwasser2015AdaptivelySC,
  title={Adaptively Secure Coin-Flipping, Revisited},
  author={Shafi Goldwasser and Yael Tauman Kalai and Sunoo Park},
  booktitle={IACR Cryptology ePrint Archive},
  year={2015}
}
The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of n players with t = t(n) faults. They showed that the majority protocol, in which each player sends a random bit and the output is the majority of the players’ bits, can tolerate t(n) = O( √ n) even in the presence of adaptive corruptions, and they conjectured that this is optimal for such adversaries. Lichtenstein, Linial… CONTINUE READING
Tweets
This paper has been referenced on Twitter 3 times. VIEW TWEETS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

, and Avi Wigderson . “ How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority ”

  • Silvio Micali
  • 2011

“ Noncryptographic Selection Protocols ” . In : FOCS

  • Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou
  • Proceedings of the 30 th Annual ACM SIGACT…
  • 1999

Similar Papers

Loading similar papers…