Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

Gilad Asharov, Yehuda Lindell, Tal Rabin

Published Jan 1, 2013• 28 citations
Publisher
DOI
10.1007/978-3-642-36594-2_14

Related papers

A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss

Ke Wu, Gilad Asharov, Elaine Shi

Lecture notes in computer science•Jan 1, 2022•10 citations

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

Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin

Lecture notes in computer science•Jan 1, 2014•31 citations

Fair Multiparty Coin Tossing from Minimal Assumptions

Marshall Ball, Miranda Christ, Yevgeniy Dodis +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

An Optimally Fair Coin Toss

Tal Moran, Moni Naor, Gil Segev

Lecture notes in computer science•Jan 1, 2009•88 citations

An Optimally Fair Coin Toss

Tal Moran, Moni Naor, Gil Segev

Journal of Cryptology•Feb 20, 2015•35 citations

Game-Theoretically Fair Coin Toss with Arbitrary Preferences

Forest Zhang, Ke Wu

Lecture notes in computer science•Dec 7, 2025•0 citations