On the complexity of fair coin flipping

DOI10.1016/J.TCS.2022.02.010OpenAlexW4213227170MaRDI QIDQ5918656

Eran Omri, Nikolaos Makriyannis, Iftach Haitner

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

fairnesscoin-flippingkey-agreement

Mathematics Subject Classification ID

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

Cites Work

• An optimally fair coin toss
• Black-box use of one-way functions is useless for optimal fair coin-tossing
• Protocols for multiparty coin toss with a dishonest majority
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
• On the Black-Box Complexity of Optimally-Fair Coin Tossing
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
• An Optimally Fair Coin Toss
• Coin Flipping of Any Constant Bias Implies One-Way Functions
• Fair Coin Flipping: Tighter Analysis and the Many-Party Case
• Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
• Probability Inequalities for Sums of Bounded Random Variables
• Coin Flipping with Constant Bias Implies One-Way Functions
• Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
• On the complexity of fair coin flipping

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