1/p-secure multiparty computation without honest majority and the best of both worlds

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

Volumn 6841 LNCS, Issue , 2011, Pages 277-296

  Beimel, Amos ^a   Lindell, Yehuda ^b   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

CRYPTOGRAPHY;

FALL BACKS; IDEAL MODEL; MULTI-PARTY PROTOCOLS; MULTIPARTY COMPUTATION; NEGATIVE SIDES; SECURITY PARAMETERS; TRUSTED PARTY;

POLYNOMIALS;

EID: 80051969535     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22792-9_16     Document Type: Conference Paper

References (26)

1. Beaver, D., Goldwasser, S.: Multiparty computation with faulty majority. In: 30th FOCS, pp. 468-473 (1989)
2. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: 22nd STOC, pp. 503-513 (1990)
3. Beimel, A., Omri, E., Orlov, I.: Protocols for multiparty coin toss with dishonest majority. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 538-557. Springer, Heidelberg (2010)
4. Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.: A fair protocol for signing contracts. In: 12th ICALP, pp. 43-52 (1985)
5. Blum, M.: How to exchange (secret) keys. ACM Trans. Comput. Syst. 1(2), 175-193 (1983)
6. Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236-254. Springer, Heidelberg (2000)
7. Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: 18th STOC, pp. 364-369 (1986)
8. Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 573-588. Springer, Heidelberg (1990)
9. Damgård, I.: Practical and provably secure release of a secret and exchange of signatures. J. of Cryptology 8(4), 201-222 (1995)
10. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. CACM 28(6), 637-647 (1985)
11. Galil, Z., Haber, S., Yung, M.: Cryptographic computation: Secure fault tolerant protocols and the public-key model. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 135-155. Springer, Heidelberg (1988)
12. Garay, J.A., MacKenzie, P.D., Prabhakaran, M., Yang, K.: Resource fairness and composability of cryptographic protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 404-428. Springer, Heidelberg (2006)
13. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: 19th STOC, pp. 218-229 (1987)
14. Goldwasser, S., Levin, L.: Fair computation of general functions in presence of immoral majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 77-93. Springer, Heidelberg (1991)
15. Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure twoparty computation. In: 40th STOC, pp. 413-422 (2008)
16. Gordon, D. S., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On complete primitives for fairness. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 91-108. Springer, Heidelberg (2010)
17. Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 19-35. Springer, Heidelberg (2009)
18. Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 157-176. Springer, Heidelberg (2010)
19. Ishai, Y., Katz, J., Kushilevitz, E., Lindell, Y., Petrank, E.: On achieving the "best of both world" in secure multiparty computation. SIAM J. on Computing 40(1) (2011) (Journal version of [20, 21])
20. Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: On combining privacy with guaranteed output delivery in secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 483-500. Springer, Heidelberg (2006)
21. Katz, J.: On achieving the "best of both worlds" in secure multiparty computation. In: 39th STOC, pp. 11-20 (2007)
22. Luby, M., Micali, S., Rackoff, C.: How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In: 24th FOCS, pp. 11-21 (1983)
23. 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)
24. Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: 36th STOC, pp. 232-241 (2004)
25. Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 87-105. Springer, Heidelberg (2003)
26. Yao,A.C.:Howto generate and exchange secrets. In: 27th FOCS, pp. 162-167 (1986)