Rationality and adversarial behavior in multi-party computation

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

Volumn 4117 LNCS, Issue , 2006, Pages 180-197

  Lysyanskaya, Anna ^a   Triandopoulos, Nikos ^a  

^a Brown University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

ADVERSARIAL BEHAVIOR; MIXED BEHAVIOR MODEL; MULTIPARTY COMPUTATION;

SECURITY OF DATA;

EID: 33749541500     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_11     Document Type: Conference Paper

References (13)

1. I. Abraham, D. Dolev, R. Gonen, and J. Halpern. Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In Proc. 25th ACM PODC, 2006. (To appear.)
2. R. Canetti and M. Fischlin. Universally composable commitments. In Proc. CRYPTO 2001, pages 19-40, 2001.
3. R. Canetti, Y. Lindeil, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In Proc. 34th ACM Symposium on Theory of Computing (STOC), pages 494-503, 2002.
4. A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust non-interactive zero knowledge. In Proc. CRYPTO 2001, pages 566-598, 2001.
5. O. Goldreich. Foundations of Cryptography. Cambridge University Press, 2004.
6. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
7. S. D. Gordon and J. Katz. Rational secret sharing, revisited, 2006. Manuscript available at http://eprint.iacr.org/2006/142. (To appear at SCN 2006.)
8. J. Halpern and V. Teague. Rational secret sharing and multiparty computation: extended abstract. In Proc. 36th ACM Symposium on Theory of Computing (STOC), pages 623-632, 2004.
9. S. Izmalkov, M. Lepinski, and S. Micali. Rational secure computation and ideal mechanism design. In Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS), pages 585-594, 2005.
10. M. Lepinksi, S. Micali, and abhi shelat. Collusion-free protocols. In Proc. 37th ACM Symposium on Theory of Computing, pages 543-552, 2005.
11. M. Lepinski, S. Micali, C. Peikert, and A. Shelat. Completely fair SFE and coalition-safe cheap talk. In Proc. 23rd ACM PODC, pages 1-10, 2004.
12. A. Shamir. How to share a secret. Comm. of the ACM, 22(11):612-613, 1979.
13. Y. Shoham and M. Tennenholtz. Non-cooperative computation: Boolean functions with correctness and exclusivity. Theoretical Comp. Science, 343(2):97-113, 2005.