A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness

DOI10.1007/978-3-642-36594-2_14zbMath1315.94051OpenAlexW2098728856MaRDI QIDQ4910281

Yehuda Lindell, Tal Rabin, Gilad Asharov

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_14

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness