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

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

Volumn 7785 LNCS, Issue , 2013, Pages 243-262

  Asharov, Gilad ^a   Lindell, Yehuda ^a   Rabin, Tal ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COIN-TOSSING; FINITE DOMAINS; IMPOSSIBILITY RESULTS;

CHARACTERIZATION; CRYPTOGRAPHY; INFORMATION THEORY;

BOOLEAN FUNCTIONS;

EID: 84873977107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36594-2_14     Document Type: Conference Paper

References (13)

1. Full version of this work. Cryptology ePrint Archive (2013)
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: 20th STOC, pp. 1-10 (1988)
3. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)
4. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: The 20th STOC, pp. 1-10 (1988)
5. Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: The 18th STOC, pp. 364-369 (1986)
6. Goldreich, O.: The Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press (2004)
7. Goldreich, O., Micali, S.,Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. JACM 38(1), 691-729 (1991)
8. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: The 19th STOC, pp. 218-229 (1987)
9. Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. JACM 58(6), 24 (2011)
10. Kilian, J.: A general completeness theorem for two-party games. In: 23rd STOC, pp. 553-560 (1991)
11. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: The 21st STOC, pp. 73-85 (1989)
12. von Neumann, J.: Various Techniques Used in Connection with Random Digits. Journal of Research of the National Bureau of Standards 12, 36-38 (1951)
13. Yao, A.: How to generate and exchange secrets (extended abstract). In: The 27th FOCS, pp. 162-167 (1986)