On achieving the "best of both worlds" in secure multiparty computation

SIAM Journal on Computing

Volumn 40, Issue 1, 2011, Pages 122-141

  Ishai, Yuval ^a   Katz, Jonathan ^b   Kushilevitz, Eyal ^a   Lindell, Yehuda ^c   Petrank, Erez ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b University of Maryland   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

Secure computation; Theory of cryptography

Indexed keywords

ARBITRARY NUMBER; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION; THEORY OF CRYPTOGRAPHY;

COMPUTATION THEORY;

CRYPTOGRAPHY;

EID: 79952946379     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/100783224     Document Type: Article

References (22)

1. Y. Aumann and Y. Lindell, Security against covert adversaries: Efficient protocols for realistic adversaries, in Proceedings of the 4th Annual Theory of Cryptography Conference (TCC 2007), Lecture Notes in Comput. Sci. 4392, Springer, Berlin, 2007, pp. 137-156.
2. D. Beaver, Multiparty protocols tolerating half faulty processors, in Advances in Cryptology (Crypto'89), Lecture Notes in Comput. Sci. 435, Springer-Verlag, New York, 1990, pp. 560-572.
3. D. Beaver and S. Goldwasser, Multiparty computation with faulty majority, in Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 1989, pp. 468-473. (Pubitemid 20725989)
4. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 1988, pp. 1-10.
5. R. Canetti, Security and composition of multiparty cryptographic protocols, J. Cryptology, 13 (2000), pp. 143-202.
6. R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 2001, pp. 136-145. (Pubitemid 33068374)
7. R. Canetti, Security and composition of cryptographic protocols: A tutorial (part I), SIGACT News, 37 (2006), pp. 67-92.
8. D. Chaum, C. Crépeau, and I. Damgård, Multiparty unconditionally secure protocols, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 1988, pp. 11-19.
9. R. Cleve, Limits on the security of coin flips when half the processors are faulty, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 1986, pp. 364-369.
10. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin, Efficient multiparty computations secure against an adaptive adversary, in Advances in Cryptology (Eurocrypt'99), Lecture Notes in Comput. Sci. 1592, Springer-Verlag, Berlin, 1999, pp. 311-326.
11. O. Goldreich, Foundations of Cryptography, Vol. 2: Basic Applications, Cambridge University Press, Cambridge, UK, 2004.
12. O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, or a completeness theorem for protocols with honest majority, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 1987, pp. 218-229. (Pubitemid 18643409)
13. S. Goldwasser and L. A. Levin, Fair computation of general functions in presence of immoral majority, in Advances in Cryptology (Crypto'90), Lecture Notes in Comput. Sci. 537, Springer-Verlag, Berlin, 1991, pp. 77-93.
14. S. Goldwasser and Y. Lindell, Secure multiparty computation without agreement, J. Cryptology, 18 (2005), pp. 247-287. (Pubitemid 40997661)
15. S. D. Gordon, C. Hazay, J. Katz, and Y. Lindell, Complete fairness in secure two-party computation, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2008, pp. 413-422.
16. S. D. Gordon and J. Katz, Complete fairness in multiparty computation without an honest majority, in Proceedings of the 6th Annual Theory of Cryptography Conference (TCC 2009), Lecture Notes in Comput. Sci. 5444, Springer, Berlin, 2009, pp. 19-35.
17. S. D. Gordon and J. Katz, Partial fairness in secure two-party computation, in Advances in Cryptology (Eurocrypt 2010), Lecture Notes in Comput. Sci. 6110, Springer, Berlin, 2010, pp. 157-176.
18. Y. Ishai, E. Kushilevitz, Y. Lindell, and E. Petrank, On combining privacy with guaranteed output delivery in secure multiparty computation, in Advances in Cryptology (Crypto 2006), Lecture Notes in Comput. Sci. 4117, Springer-Verlag, Berlin, 2006, pp. 483-500. (Pubitemid 44532134)
19. J. Katz, On achieving the "best of both worlds" in secure multiparty computation, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2007, pp. 11-20. (Pubitemid 47630716)
20. T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 1989, pp 73-85.
21. A. Shamir, How to share a secret, Comm. ACM, 22 (1979), pp. 612-613.
22. A. C.-C. Yao, How to generate and exchange secrets, in Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 1986, pp. 162-167.