Protocols for Multiparty Coin Toss with Dishonest Majority
From MaRDI portal
Publication:3582776
DOI10.1007/978-3-642-14623-7_29zbMath1283.94049OpenAlexW1568042310MaRDI QIDQ3582776
Eran Omri, Ilan Orlov, Amos Beimel
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_29
Related Items (14)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ An optimally fair coin toss ⋮ 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 ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ Network Oblivious Transfer ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: Protocols for Multiparty Coin Toss with Dishonest Majority
