Lecture notes in computer science

On the Black-Box Complexity of Optimally-Fair Coin Tossing

Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin

Published Jan 1, 2011• 60 citations

Related papers

Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing

Hemanta K. Maji, Mingyuan Wang

Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?

Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin

An Optimally Fair Coin Toss

Tal Moran, Moni Naor, Gil Segev

List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

An Optimally Fair Coin Toss

Tal Moran, Moni Naor, Gil Segev

Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious

Bar Alon, Eran Omri