Complete fairness in secure two-party computation

Journal of the ACM

Volumn 58, Issue 6, 2011, Pages

  Gordon, S Dov ^a   Hazay, Carmit ^b   Katz, Jonathan ^c   Lindell, Yehuda ^d  

^a Columbia University ^*  (United States)

^b AARHUS UNIVERSITY   (Denmark)

^c A V Williams Building ^*  (United States)

^d BAR ILAN UNIVERSITY   (Israel)

Author keywords

Cryptography; Fairness; Secure computation

Indexed keywords

CRYPTOGRAPHIC ASSUMPTIONS; FAIRNESS; LOWER BOUNDS; NON-TRIVIAL; NON-TRIVIAL FUNCTION; ROUND COMPLEXITY; SECURE COMPUTATION; SECURE TWO-PARTY COMPUTATIONS; SECURITY PARAMETERS; SECURITY PROPERTIES;

BOOLEAN FUNCTIONS; CRYPTOGRAPHY;

COMPUTATION THEORY;

EID: 84855248474     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2049697.2049698     Document Type: Conference Paper

References (35)

1. BEAVER, D. 1991. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. J. Crypt. 4, 2, 75-122.
2. BEAVER, D. 1992. Foundations of secure interactive computing. In Proceedings of the Conference on Advances in Cryptology (Crypto'91). Lecture Notes in Computer Science, vol. 576. Springer, 377-391.
3. BEAVER, D. AND GOLDWASSER, S. 1989. Multiparty computation with faulty majority. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 468-473. (Pubitemid 20725989)
4. BEIMEL, A., OMRI, E., AND ORLOV, I. 2010. Protocols for multiparty coin toss with dishonest majority. In Proceedings of the Conference on Advances in Cryptology (Crypto'10). Lecture Notes in Computer Science, vol. 6223. Springer, 538-557.
5. BEIMEL, A., LINDELL, Y., OMRI, E., AND ORLOV, I. 2011. 1/p-secure multiparty computation without honest majority and the best of both worlds. In Proceedings of the Conference on Advances in Cryptology (Crypto'11). Lecture Notes in Computer Science, vol. 6841. Springer, 277-196.
6. BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th ACMSTOC Annual ACMSymposium on Theory of Computing (STOC). ACM, 1-10.
7. BEN-OR, M., GOLDREICH, O.,MICALI, S., AND RIVEST, R. 1990. A fair protocol for signing contracts. IEEE Trans. Inf. Theory 36, 1, 40-46.
8. BLUM, M. 1983. How to exchange (secret) keys. ACM Trans. Comput. Syst. 1, 2, 175-193.
9. BONEH, D. AND NAOR, M. 2000. Timed commitments. In Proceedings of the Conference on Advances in Cryptology (Crypto'00). Lecture Notes in Computer Science, vol. 1880. Springer, 236-254.
10. CANETTI, R. 2000. Security and composition of multiparty cryptographic protocols. J. Crypt. 13, 1, 143-202.
11. CHAUM, D., CRÉPEAU, C., AND DAMGARD, I. 1988. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). ACM, 11-19.
12. CHOR, B. AND KUSHILEVITZ, E. 1991. A zero-one law for Boolean privacy. SIAM J. Discr. Math. 4, 36-47.
13. CLEVE, R. 1986. 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, 364-369.
14. CLEVE, R. 1990. Controlled gradual disclosure schemes for random bits and their applications. In Proceedings of the Conference on Advances in Cryptology (Crypto'89). Lecture Notes in Computer Science, vol. 435. Springer, 573-588.
15. DAMGARD, I. 1995. Practical and provably secure release of a secret and exchange of signatures. J. Crypt. 8, 4, 201-222.
16. EVEN, S., GOLDREICH, O., AND LEMPEL, A. 1985. A randomized protocol for signing contracts. Comm. ACM 28, 6, 637-647.
17. GALIL, Z.,HABER, S., AND YUNG, M. 1988. Cryptographic computation: Secure fault-tolerant protocols and the public-key model. In Proceedings of the Conference on Advances in Cryptology (Crypto'87). Lecture Notes in Computer Science, vol. 293. Springer, 135-155.
18. GARAY, J.,MACKENZIE, P. D., PRABHAKARAN, M., AND YANG, K. 2011. Resource fairness and composability of cryptographic protocols. J. Crypt. 24, 4, 615-658.
19. GOLDREICH, O. 2004. Foundations of Cryptography Vol. 2: Basic Applications. Cambridge University Press, Cambridge, UK.
20. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. 1987. 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, 218-229. (Pubitemid 18643409)
21. GOLDWASSER, S. AND LEVIN, L. A. 1991. Fair computation of general functions in presence of immoral majority. In Proceedings of the Conference on Advances in Cryptology (Crypto'90). Lecture Notes in Computer Science, vol. 537. Springer, 77-93.
22. GORDON, S. D. 2010. Fairness in secure computation. Ph.D. thesis, University of Maryland.
23. GORDON, S. D. AND KATZ, J. 2009. Complete fairness in multi-party computation without an honest majority. In Proceedings of the 6th Theory of Cryptography Conference (TCC'09). Lecture Notes in Computer Science, vol. 5444. Springer, 19-35.
24. GORDON, S. D. AND KATZ, J. 2010. Partial fairness in secure two-party computation. In Proceedings of the Conference on Advances in Cryptology (Eurocrypt'10). Lecture Notes in Computer Science, vol. 6110. Springer, 157-176. Full version to appear in J. Cryptology.
25. GORDON, S. D., HAZAY, C., KATZ, J., AND LINDELL, Y. 2008. Complete fairness in secure two-party computation. http://eprint.iacr.org.
26. ISHAI, Y.,KATZ, J., KUSHILEVITZ, E., LINDELL, Y., AND PETRANK, E. 2011. On achieving the "best of both worlds" in secure multiparty computation. SIAM J. Comput. 40, 1, 122-141.
27. KILIAN, J. 1988. Founding cryptography on oblivious transfer. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). ACM, 20-31.
28. KILIAN, J. 1991. A general completeness theorem for two-party games. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC). ACM, 553-560.
29. LINDELL, Y. 2003. Parallel coin-tossing and constant-round secure two-party computation. J. Crypt. 16, 3, 143-184. (Pubitemid 41201208)
30. LUBY, M., MICALI, S., AND RACKOFF, C. 1983. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 23-30.
31. MICALI, S. AND ROGAWAY, P. 1992. Secure computation. In Proceedings of the Conference on Advances in Cryptology (Crypto'91). Lecture Notes in Computer Science, vol. 576. Springer, 392-404.
32. MORAN, T., NAOR, M., AND SEGEV, G. 2009. An optimally fair coin toss. In Proceedings of the 6th Theory of Cryptography Conference (TCC'09). Lecture Notes in Computer Science, vol. 5444. Springer, 1-18.
33. PINKAS, B. 2003. Fair secure two-party computation. In Proceedings of the Conference on Advances in Cryptology (Eurocrypt'03). Lecture Notes in Computer Science, vol. 2656. Springer, 87-105. (Pubitemid 36572170)
34. RABIN, T. AND BEN-OR, M. 1989. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC). ACM, 73-85.
35. YAO, A. C. 1982. Protocols for secure computations. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 160-164.