{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T16:10:17Z","timestamp":1786291817995,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642320088","type":"print"},{"value":"9783642320095","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32009-5_9","type":"book-chapter","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T06:40:28Z","timestamp":1344235228000},"page":"124-143","source":"Crossref","is-referenced-by-count":18,"title":["Collusion-Preserving Computation"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","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: 25th ACM PODC, pp. 53\u201362. ACM Press (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-78524-8_17","volume-title":"Theory of Cryptography","author":"I Abraham","year":"2008","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: Lower Bounds on Implementing Robust and Resilient Mediators. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 302\u2013319. Springer, Heidelberg (2008)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-03356-8_31","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J Alwen","year":"2009","unstructured":"Alwen, J., Katz, J., Lindell, Y., Persiano, G., Shelat, A., Visconti, I.: Collusion-Free Multiparty Computation in the Mediated Model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 524\u2013540. Springer, Heidelberg (2009)"},{"key":"9_CR4","unstructured":"Alwen, J., Katz, J., Maurer, U., Zikas, V.: Collusion preserving computation. Cryptology ePrint Archive, Report 2011\/443 (2011), http:\/\/eprint.iacr.org\/2011\/433"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-85174-5_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J Alwen","year":"2008","unstructured":"Alwen, J., Shelat, A., Visconti, I.: Collusion-Free Protocols in the Mediated Model. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 497\u2013514. Springer, Heidelberg (2008)"},{"key":"9_CR6","unstructured":"Aumann, R.: Subjectivity and Correlation in Randomized Strategies. Journal of Math. Econ. 1, 67\u201396 (1974)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Topics in Mathematical Economics and Game Theory Essays in Honor of Robert J Aumann, vol. 23, pp. 287\u2013324 (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Barany, I.: Fair distribution protocols, or how the players replace fortune. Mathematics of Operations Research 17, 327\u2013340 (1992)","DOI":"10.1287\/moor.17.2.327"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE (2001), Full version at http:\/\/eprint.iacr.org\/2000\/067\/","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally Composable Security with Global Setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509978.509980"},{"key":"9_CR12","unstructured":"Canetti, R., Vald, M.: Universally composable security with local adversaries. Cryptology ePrint Archive, Report 2012\/117 (2012), http:\/\/eprint.iacr.org\/2012\/117"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Crawford, V., Sobel, J.: Strategic information transmission. Econometrica 50, 1431\u20131451 (1982)","DOI":"10.2307\/1913390"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-00457-5_10","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Katz, J., Smith, A., Walfish, S.: Composability and On-Line Deniability of Authentication. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 146\u2013162. Springer, Heidelberg (2009)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Forges, F.: Universal mechanisms. Econometrica 58, 1342\u20131364 (1990)","DOI":"10.2307\/2938319"},{"key":"9_CR16","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"9_CR17","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: 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Rational Secure Computation and Ideal Mechanism Design. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 585\u2013595. IEEE Computer Society, Washington, DC (2005)","DOI":"10.1109\/SFCS.2005.64"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-78524-8_16","volume-title":"Theory of Cryptography","author":"S Izmalkov","year":"2008","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Verifiably Secure Devices. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 273\u2013301. Springer, Heidelberg (2008)"},{"key":"9_CR20","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Perfect implementation. Games and Economic Behavior\u00a071(1), 121\u2013140 (2011), http:\/\/hdl.handle.net\/1721.1\/50634"},{"key":"9_CR21","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: 46th FOCS, pp. 585\u2013595. IEEE (2005), Full version available at http:\/\/dspace.mit.edu\/handle\/1721.1\/38208"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Lepinksi, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: STOC 2005: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 543\u2013552. ACM, New York (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalitionsafe cheap talk. In: 23rd ACM PODC, pp. 1\u201310. ACM Press (2004)","DOI":"10.1145\/1011767.1011769"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Collusion-free protocols. In: 37th ACM STOC, pp. 543\u2013552. ACM Press (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30576-7_14","volume-title":"Theory of Cryptography","author":"M Lepinski","year":"2005","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Fair-Zero Knowledge. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 245\u2013263. Springer, Heidelberg (2005)"},{"key":"9_CR26","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: Innovations in Computer Science. Tsinghua University Press (2011)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Simmons, G.J.: The prisoners\u2019 problem and the subliminal channel. In: Crypto 1983, pp. 51\u201367. Plenum Press (1984)","DOI":"10.1007\/978-1-4684-4730-9_5"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Simmons, G.J.: Cryptanalysis and protocol failures. Communications of the ACM 37(11), 56\u201365 (1994)","DOI":"10.1145\/188280.188298"},{"key":"9_CR30","series-title":"LNCS","first-page":"237","volume-title":"IH 1996","author":"GJ Simmons","year":"1996","unstructured":"Simmons, G.J.: The History of Subliminal Channels. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 237\u2013256. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32009-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T15:58:38Z","timestamp":1743955118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32009-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320088","9783642320095"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32009-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}