Protocols for multiparty coin toss with dishonest majority

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

Volumn 6223 LNCS, Issue , 2010, Pages 538-557

  Beimel, Amos ^a   Omri, Eran ^b   Orlov, Ilan ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKES; COIN-TOSSING PROTOCOL; CRYPTOGRAPHIC PROTOCOLS; UNIFORM DISTRIBUTION;

OPTIMIZATION;

CRYPTOGRAPHY;

EID: 77956987124     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14623-7_29     Document Type: Conference Paper

References (14)

1. Aumann, Y., Lindell, Y.: Security against covert adversaries: Efficient protocols for realistic adversaries. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 137-156. Springer, Heidelberg (2007)
2. Averbuch, B., Blum, M., Chor, B., Goldwasser, S., Micali, S.: How to implement Bracha's O(log n) Byzantine agreement algorithm (1985) (unpublished manuscript)
3. Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15(1), 23-27 (1983)
4. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. on Computing 13, 850-864 (1984)
5. Canetti, R.: Security and composition of multiparty cryptographic protocols. J. of Cryptology 13(1), 143-202 (2000)
6. Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proc. of the 18th STOC, pp. 364-369 (1986)
7. Cleve, R., Impagliazzo, R.: Martingales, collective coin flipping and discrete control processes (1993) (manuscript)
8. Goldreich, O.: Foundations of Cryptography, Voume II Basic Applications. Cambridge University Press, Cambridge (2004)
9. Gordon, D., Katz, J.: Partial fairness in secure two-party computation. Cryptology ePrint Archive, Report 2008/206 (2008), http://eprint.iacr.org/
10. Katz, J.: On achieving the "best of both worlds" in secure multiparty computation. In: Proc. of the 39th STOC, pp. 11-20. ACM Press, New York (2007)
11. Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. J. of Cryptology 16(3), 143-184 (2003)
12. Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 1-18. Springer, Heidelberg (2009)
13. Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Proc. of the 36th STOC, pp. 232-241 (2004)
14. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. of the 21st STOC, pp. 73-85 (1989)