Partial fairness in secure two-party computation

Journal of Cryptology

Volumn 25, Issue 1, 2012, Pages 14-40

  Gordon, S Dov ^a   Katz, Jonathan ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

Fairness; Secure computation

Indexed keywords

COMMUNICATION MODELS; CRYPTOGRAPHIC ASSUMPTIONS; FAIRNESS; POLYNOMIAL SIZE; SECURE COMPUTATION; SECURE TWO-PARTY COMPUTATIONS; TRAPDOOR PERMUTATIONS; TWO-PARTY COMPUTATION;

CRYPTOGRAPHY; INFORMATION THEORY; POLYNOMIALS; STANDARDS;

COMPUTATION THEORY;

EID: 84855447466     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-010-9079-5     Document Type: Article

References (31)

1. Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries, in Theory of Cryptography Conference-TCC 2007. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 137-156
2. D. Beaver, Foundations of secure interactive computing, in Advances in Cryptology-Crypto '91. LNCS, vol. 576 (Springer, Berlin, 1992), pp. 377-391
3. D. Beaver, S. Goldwasser, Multiparty computation with faulty majority, in 30th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Press, New York, 1989), pp. 468-473 (Pubitemid 20725989)
4. A. Beimel, E. Omri, I. Orlov, Protocols for multiparty coin toss with dishonest majority, in Advances in Cryptology-Crypto 2010. LNCS, vol. 6223 (Springer, Berlin, 2010), pp. 538-557
5. M. Ben-Or O. Goldreich S. Micali R. Rivest 1990 A fair protocol for signing contracts IEEE Trans. Inf. Theory 36 1 40 46 10.1109/18.50372 (Pubitemid 20678403)
6. M. Blum 1984 How to exchange (secret) keys ACM Trans. Comput. Syst. 1 175 193 10.1145/357360.357368
7. D. Boneh, M. Naor, Timed commitments, in Advances in Cryptology-Crypto 2000. LNCS, vol. 1880 (Springer, Berlin, 2000), pp. 236-254
8. C. Cachin, J. Camenisch, Optimistic fair secure computation, in Advances in Cryptology -Crypto 2000. LNCS, vol. 1880 (Springer, Berlin, 2000), pp. 93-111
9. R. Canetti 2000 Security and composition of multiparty cryptographic protocols J. Cryptol. 13 1 143 202 10.1007/s001459910006 0957.68040 1732900
10. R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42nd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Press, New York, 2001), pp. 136-145 (Pubitemid 33068374)
11. R. Cleve, Limits on the security of coin flips when half the processors are faulty, in 18th Annual ACM Symposium on Theory of Computing (STOC) (Assoc. Comput. Mach., New York, 1986), pp. 364-369
12. R. Cleve, Controlled gradual disclosure schemes for random bits and their applications, in Advances in Cryptology-Crypto '89. LNCS, vol. 435 (Springer, Berlin, 1990), pp. 573-588
13. I. Damgård 1995 Practical and provably secure release of a secret and exchange of signatures J. Cryptol. 8 4 201 222 10.1007/BF00191356 0840.94014
14. C. Dwork M. Naor A. Sahai 2004 Concurrent zero-knowledge J. ACM 51 6 851 898 1125.94031 2145257 (Pubitemid 40818309)
15. S. Even O. Goldreich A. Lempel 1985 A randomized protocol for signing contracts Commun. ACM 28 6 637 647 10.1145/3812.3818 800680 (Pubitemid 15569164)
16. M. Franklin, Complexity and security of distributed protocols. PhD thesis, Columbia University (1993)
17. Z. Galil, S. Haber, M. Yung, Cryptographic computation: Secure faut-tolerant protocols and the public-key model, in Advances in Cryptology-Crypto '87. LNCS, vol. 293 (Springer, Berlin, 1988), pp. 135-155
18. J.A. Garay, P.D. MacKenzie, M. Prabhakaran, K. Yang, Resource fairness and composability of cryptographic protocols, in 3rd Theory of Cryptography Conference-TCC 2006. LNCS, vol. 3876 (Springer, Berlin, 2006), pp. 404-428 (Pubitemid 43979860)
19. O. Goldreich, Basic Applications. Foundations of Cryptography, vol. 2 (Cambridge University Press, Cambridge, 2004)
20. O. Goldreich Y. Lindell 2006 Session-key generation using human passwords only J. Cryptol. 19 3 241 340 10.1007/s00145-006-0233-z 1103.68513 2241561
21. S. Goldwasser, L.A. Levin, Fair computation of general functions in presence of immoral majority, in Advances in Cryptology-Crypto '90. LNCS, vol. 537 (Springer, Berlin, 1991), pp. 77-93
22. S.D. Gordon, Fairness in secure computation. PhD thesis, University of Maryland (2010)
23. S. Gordon, J. Katz, Complete fairness in multi-party computation without an honest majority, in 6th Theory of Cryptography Conference-TCC 2009. LNCS, vol. 5444 (Springer, Berlin, 2009), pp. 19-35
24. S.D. Gordon, C. Hazay, J. Katz, Y. Lindell, Complete fairness in secure two-party computation, in 40th Annual ACM Symposium on Theory of Computing (STOC) (Assoc. Comput. Mach., New York, 2008), pp. 413-422
25. J. Katz, On achieving the "best of both worlds" in secure multiparty computation, in 39th Annual ACM Symposium on Theory of Computing (STOC) (Assoc. Comput. Mach., New York, 2007), pp. 11-20 (Pubitemid 47630716)
26. M. Lepinski, S. Micali, C. Peikert, A. Shelat, Completely fair SFE and coalition-safe cheap talk, in 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC) (Assoc. Comput. Mach., New York, 2004), pp. 1-10
27. M. Luby, S. Micali, C. Rackoff, How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin, in 24th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Press, New York, 1983), pp. 23-30
28. S. Micali, P. Rogaway, Secure computation, in Advances in Cryptology-Crypto '91. LNCS, vol. 576 (Springer, Berlin, 1992), pp. 392-404
29. T. Moran, M. Naor, G. Segev, An optimally fair coin toss, in 6th Theory of Cryptography Conference-TCC 2009. LNCS, vol. 5444 (Springer, Berlin, 2009), pp. 1-18
30. B. Pinkas, Fair secure two-party computation, in Advances in Cryptology-Eurocrypt 2003. LNCS, vol. 2656 (Springer, Berlin, 2003), pp. 87-105 (Pubitemid 36572170)
31. A.C.-C. Yao, How to generate and exchange secrets, in 27th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Press, New York, 1986), pp. 162-167