Complete fairness in multi-party computation without an honest majority

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

Volumn 5444 LNCS, Issue , 2009, Pages 19-35

  Gordon, S Dov ^a   Katz, Jonathan ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPARTY COMPUTATION; NON-TRIVIAL; NON-TRIVIAL FUNCTION;

CRYPTOGRAPHY;

EID: 70350630630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00457-5_2     Document Type: Conference Paper

References (9)

1. Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proc. 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364-369 (1986)
2. Gordon, D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: Proc. 40th Annual ACM Symposium on Theory of Computing (STOC) (2008)
3. Chor, B., Ishai, Y.: On privacy and partition arguments. Inf. Comput. 167(1), 2-9 (2001)
4. Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM J. Computing 29(4), 1189-1208 (2000)
5. Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM Journal of Discrete Math 4(1), 36-47 (1991)
6. 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)
7. Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: 6th Theory of Cryptography Conference, TCC (2009), http://eprint.iacr.org/2008/458
8. Goldreich, O.: Foundations of Cryptography, Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
9. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)