Partial fairness in secure two-party computation

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

Volumn 6110 LNCS, Issue , 2010, Pages 157-176

  Gordon, S Dov ^a   Katz, Jonathan ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL SIZE; SECURE TWO-PARTY COMPUTATIONS; STANDARD ASSUMPTIONS; TWO-PARTY COMPUTATION;

CRYPTOGRAPHY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 77954649870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13190-5_8     Document Type: Conference Paper

References (29)

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. Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 377-391. Springer, Heidelberg (1992)
3. Beaver, D., Goldwasser, S.: Multiparty computation with faulty majority. In: 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 468-473. IEEE, Los Alamitos (1989)
4. Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.: A fair protocol for signing contracts. IEEE Trans. Information Theory 36(1), 40-46 (1990)
5. Blum, M.: How to exchange (secret) keys. ACM Transactions on Computer Systems 1, 175-193 (1984)
6. Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236-254. Springer, Heidelberg (2000)
7. Cachin, C., Camenisch, J.: Optimistic fair secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 93-111. Springer, Heidelberg (2000)
8. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)
9. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 136-145. IEEE, Los Alamitos (2001)
10. Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364-369. ACM Press, New York (1986)
11. 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)
12. Damgård, I.: Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology 8(4), 201-222 (1995)
13. Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. Journal of the ACM 51(6), 851-898 (2004)
14. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Comm. ACM 28(6), 637-647 (1985)
15. Franklin, M.: Complexity and Security of Distributed Protocols. PhD thesis, Columbia University (1993)
16. Galil, Z., Haber, S., Yung, M.: Cryptographic computation: Secure faut-tolerant protocols and the public-key model. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 135-155. Springer, Heidelberg (1988)
17. 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)
18. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
19. Goldreich, O., Lindell, Y.: Session-key generation using human passwords only. Journal of Cryptology 19(3), 241-340 (2006) (Pubitemid 43911784)
20. Goldwasser, S., Levin, L.A.: 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)
21. 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)
22. Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 413-422. ACM Press, New York (2008)
23. Katz, J.: On achieving the "best of both worlds" in secure multiparty computation. In: 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 11-20. ACM Press, New York (2007)
24. Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: 23rd ACM Symposium Annual on Principles of Distributed Computing, pp. 1-10. ACM Press, New York (2004)
25. Luby, M., Micali, S., Rackoff, C.: How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In: 24th Annual Symposium on Foundations of Computer Science (FOCS), pp. 23-30. IEEE, Los Alamitos (1983)
26. Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 392-404. Springer, Heidelberg (1992)
27. 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)
28. Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 87-105. Springer, Heidelberg (2003)
29. Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (FOCS), pp. 162-167. IEEE, Los Alamitos (1986)