Full Characterization of Functions that Imply Fair Coin Tossing and

Gilad Asharov, Yehuda Lindell, Tal Rabin

Research output: Contribution to journalArticlepeer-review


It is well known that it is impossible for two parties to toss a coin fairly (Cleve, STOC 1986). This result implies that it is impossible to securely compute with fairness any function that can be used to toss a coin fairly. In this paper, we focus on the class of deterministic Boolean functions with finite domain, and we ask for which functions in this class is it possible to information-theoretically toss an unbiased coin, given a protocol for securely computing the function with fairness. We provide a \emph{complete characterization} of the functions in this class that imply and do not imply fair coin tossing. This characterization extends our knowledge of which functions cannot be securely computed with fairness. In addition, it provides a focus as to which functions may potentially be securely computed with fairness, since a function that cannot be used to fairly toss a coin is not ruled out by the impossibility result of Cleve (which is the \emph{only} known impossibility result for fairness). In addition to the above, we draw corollaries to the feasibility of achieving fairness in two possible fail-stop models.
Original languageEnglish
Article number2013/110
Number of pages37
JournalIACR Cryptology ePrint Archive,
StatePublished - 25 Feb 2013


Dive into the research topics of 'Full Characterization of Functions that Imply Fair Coin Tossing and'. Together they form a unique fingerprint.

Cite this