On the complexity of fair coin flipping

DOI10.1016/J.TCS.2022.02.010MaRDI QIDQ5918656zbMATH OpenOpenAlexFDO

Authors Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Publication date 19 April 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.00780

zbMATH Keywords

coin-flippingfairnesskey-agreement

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Cryptography (94A60)

Recommendations

• On the complexity of fair coin flipping
• An Optimally Fair Coin Toss
• An optimally fair coin toss
• On the Black-Box Complexity of Optimally-Fair Coin Tossing
• Can optimally-fair coin tossing be based on one-way functions?

Cites work

• Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
• An Optimally Fair Coin Toss
• An optimally fair coin toss
• Black-box use of one-way functions is useless for optimal fair coin-tossing
• Can optimally-fair coin tossing be based on one-way functions?
• Coin flipping of \textit{any} constant bias implies one-way functions
• Coin Flipping with Constant Bias Implies One-Way Functions
• Computational two-party correlation: a dichotomy for key-agreement protocols
• Fair coin flipping: tighter analysis and the many-party case
• On the Black-Box Complexity of Optimally-Fair Coin Tossing
• On the complexity of fair coin flipping
• Probability Inequalities for Sums of Bounded Random Variables
• Protocols for multiparty coin toss with a dishonest majority

Cited in

(2)

• Achieving Optimal Fairness from Biased Coinflips
• On the Black-Box Complexity of Optimally-Fair Coin Tossing

This page was built for publication: On the complexity of fair coin flipping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918656)