Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2105.00780 · Theoretical Computer Science

On the complexity of fair coin flipping

Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Published Feb 14, 2022• 2 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2022.02.010

Related papers

On the Complexity of Fair Coin Flipping

Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Lecture notes in computer science•Jan 1, 2018•18 citations

On the Black-Box Complexity of Optimally-Fair Coin Tossing

Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody +1 more

Lecture notes in computer science•Jan 1, 2011•60 citations

Optimal Coin Flipping

Dexter C. Kozen

Lecture notes in computer science•Jan 1, 2014•2 citations

Tight Bounds for Classical and Quantum Coin Flipping

Esther Hänggi, Jürg Wullschleger

arXiv:1009.4741•Lecture notes in computer science•Jan 1, 2011•20 citations

Robust Coin Flipping

Gene S. Kopp, John D. Wiltshire-Gordon

arXiv:1009.4188•Lecture notes in computer science•Jan 1, 2012•0 citations

Adaptively Secure Coin-Flipping, Revisited

Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park

Lecture notes in computer science•Jan 1, 2015•18 citations