{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:37:50Z","timestamp":1767339470635},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540374329"},{"type":"electronic","value":"9783540374336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_11","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T02:21:52Z","timestamp":1158978112000},"page":"180-197","source":"Crossref","is-referenced-by-count":78,"title":["Rationality and Adversarial Behavior in Multi-party Computation"],"prefix":"10.1007","author":[{"given":"Anna","family":"Lysyanskaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Triandopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In: Proc. 25th ACM PODC (to appear, 2006)","key":"11_CR1","DOI":"10.1145\/1146381.1146393"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proc. 34th ACM Symposium on Theory of Computing (STOC), pp. 494\u2013503 (2002)","key":"11_CR3","DOI":"10.1145\/509907.509980"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"},{"key":"11_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Cambridge University Press, Cambridge (2004)"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: 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), pp. 218\u2013229 (1987)","key":"11_CR6","DOI":"10.1145\/28395.28420"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11832072_16","volume-title":"Security and Cryptography for Networks","author":"S.D. Gordon","year":"2006","unstructured":"Gordon, S.D., Katz, J.: Rational secret sharing, revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 229\u2013241. Springer, Heidelberg (2006); manuscript available at: http:\/\/eprint.iacr.org\/2006\/142"},{"doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: Proc. 36th ACM Symposium on Theory of Computing (STOC), pp. 623\u2013632 (2004)","key":"11_CR8","DOI":"10.1145\/1007352.1007447"},{"doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Rational secure computation and ideal mechanism design. In: Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 585\u2013594 (2005)","key":"11_CR9","DOI":"10.1109\/SFCS.2005.64"},{"doi-asserted-by":"crossref","unstructured":"Lepinksi, M., Micali, S., Shelat, A.: Collusion-free protocols. In: Proc. 37th ACM Symposium on Theory of Computing, pp. 543\u2013552 (2005)","key":"11_CR10","DOI":"10.1145\/1060590.1060671"},{"doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: Proc. 23rd ACM PODC, pp. 1\u201310 (2004)","key":"11_CR11","DOI":"10.1145\/1011767.1011769"},{"issue":"11","key":"11_CR12","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Comm. of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm. of the ACM"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2005.05.009","volume":"343","author":"Y. Shoham","year":"2005","unstructured":"Shoham, Y., Tennenholtz, M.: Non-cooperative computation: Boolean functions with correctness and exclusivity. Theoretical Comp. Science\u00a0343(2), 97\u2013113 (2005)","journal-title":"Theoretical Comp. Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:16:05Z","timestamp":1605626165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11818175_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}