A full characterization of functions that imply fair coin tossing and ramifications to fairness

Gilad Asharov; Yehuda Lindell; Tal Rabin

doi:10.1007/978-3-642-36594-2_14

A full characterization of functions that imply fair coin tossing and ramifications to fairness

Gilad Asharov, Yehuda Lindell, Tal Rabin

Department of Computer Science

IBM

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

Abstract

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 fair coin. 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 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 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 language	English
Title of host publication	Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings
Pages	243-262
Number of pages	20
DOIs	https://doi.org/10.1007/978-3-642-36594-2_14
State	Published - 2013
Event	10th Theory of Cryptography Conference, TCC 2013 - Tokyo, Japan Duration: 3 Mar 2013 → 6 Mar 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7785 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th Theory of Cryptography Conference, TCC 2013
Country/Territory	Japan
City	Tokyo
Period	3/03/13 → 6/03/13

Bibliographical note

Funding Information:
The first two authors were funded by the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 239868, and by the israel science foundation (grant No. 189/11). Much of this work was carried out while they were at the IBM T.J. Watson Research Center, New York.

Funding

The first two authors were funded by the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 239868, and by the israel science foundation (grant No. 189/11). Much of this work was carried out while they were at the IBM T.J. Watson Research Center, New York.

Funders	Funder number
Seventh Framework Programme	FP/2007-2013, 239868
European Commission
Israel Science Foundation	189/11

Access to Document

10.1007/978-3-642-36594-2_14

Cite this

Asharov, G., Lindell, Y., & Rabin, T. (2013). A full characterization of functions that imply fair coin tossing and ramifications to fairness. In Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings (pp. 243-262). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7785 LNCS). https://doi.org/10.1007/978-3-642-36594-2_14

Asharov, Gilad ; Lindell, Yehuda ; Rabin, Tal. / A full characterization of functions that imply fair coin tossing and ramifications to fairness. Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. 2013. pp. 243-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3aa0f93caf5e48ad886341045161f401,

title = "A full characterization of functions that imply fair coin tossing and ramifications to fairness",

abstract = "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 fair coin. 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 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 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.",

author = "Gilad Asharov and Yehuda Lindell and Tal Rabin",

note = "Funding Information: The first two authors were funded by the European Research Council under the European Union{\textquoteright}s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 239868, and by the israel science foundation (grant No. 189/11). Much of this work was carried out while they were at the IBM T.J. Watson Research Center, New York.; 10th Theory of Cryptography Conference, TCC 2013 ; Conference date: 03-03-2013 Through 06-03-2013",

year = "2013",

doi = "10.1007/978-3-642-36594-2_14",

language = "אנגלית",

isbn = "9783642365935",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "243--262",

booktitle = "Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings",

}

Asharov, G , Lindell, Y & Rabin, T 2013, A full characterization of functions that imply fair coin tossing and ramifications to fairness. in Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7785 LNCS, pp. 243-262, 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, 3/03/13. https://doi.org/10.1007/978-3-642-36594-2_14

A full characterization of functions that imply fair coin tossing and ramifications to fairness. / Asharov, Gilad ; Lindell, Yehuda; Rabin, Tal.
Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. 2013. p. 243-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7785 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A full characterization of functions that imply fair coin tossing and ramifications to fairness

AU - Asharov, Gilad

AU - Lindell, Yehuda

AU - Rabin, Tal

N1 - Funding Information: The first two authors were funded by the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 239868, and by the israel science foundation (grant No. 189/11). Much of this work was carried out while they were at the IBM T.J. Watson Research Center, New York.

PY - 2013

Y1 - 2013

N2 - 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 fair coin. 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 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 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.

AB - 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 fair coin. 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 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 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.

UR - http://www.scopus.com/inward/record.url?scp=84873977107&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-36594-2_14

DO - 10.1007/978-3-642-36594-2_14

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84873977107

SN - 9783642365935

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 243

EP - 262

BT - Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings

T2 - 10th Theory of Cryptography Conference, TCC 2013

Y2 - 3 March 2013 through 6 March 2013

ER -

Asharov G , Lindell Y, Rabin T. A full characterization of functions that imply fair coin tossing and ramifications to fairness. In Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. 2013. p. 243-262. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-36594-2_14

A full characterization of functions that imply fair coin tossing and ramifications to fairness

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this