An Optimally Fair Coin Toss
From MaRDI portal
Publication:3611755
DOI10.1007/978-3-642-00457-5_1zbMath1213.94123OpenAlexW1581891510MaRDI QIDQ3611755
Moni Naor, Tal Moran, Gil Segev
Publication date: 3 March 2009
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_1
Related Items (24)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Incentive-driven attacker for corrupting two-party protocols ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ 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 ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Partial fairness in secure two-party computation ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Resource fairness and composability of cryptographic protocols ⋮ Characterization of secure multiparty computation without broadcast ⋮ Leakage-resilient coin tossing ⋮ What security can we achieve within 4 rounds? ⋮ Basing cryptographic protocols on tamper-evident seals ⋮ On the complexity of fair coin flipping ⋮ On the complexity of fair coin flipping ⋮ From fairness to full security in multiparty computation ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ Leakage-Resilient Coin Tossing ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: An Optimally Fair Coin Toss
