{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:10:01Z","timestamp":1748715001637,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272382"},{"type":"electronic","value":"9783319272399"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27239-9_8","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T17:19:50Z","timestamp":1449595190000},"page":"133-151","source":"Crossref","is-referenced-by-count":0,"title":["A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer"],"prefix":"10.1007","author":[{"given":"Shota","family":"Goto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junji","family":"Shikata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,8]]},"reference":[{"key":"8_CR1","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":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-32009-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"J Alwen","year":"2012","unstructured":"Alwen, J., Katz, J., Maurer, U., Zikas, V.: Collusion-preserving computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 124\u2013143. Springer, Heidelberg (2012)"},{"key":"8_CR3","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":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-20465-4_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"G Asharov","year":"2011","unstructured":"Asharov, G., Canetti, R., Hazay, C.: Towards a game theoretic view of secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 426\u2013445. Springer, Heidelberg (2011)"},{"key":"8_CR5","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A universally composable cryptographic library. In: IACR Cryptology ePrint Archive (2003)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-32928-9_16","volume-title":"Security and Cryptography for Networks","author":"R Canetti","year":"2012","unstructured":"Canetti, R., Vald, M.: Universally composable security with local adversaries. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 281\u2013301. Springer, Heidelberg (2012)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 112\u2013130. Springer, Heidelberg (2000)"},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"8_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, New York (2004)"},{"key":"8_CR12","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 Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Gradwohl, R., Livne, N., Rosen, A.: Sequential rationality in cryptographic protocols. In: 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 623\u2013632 (2010)","DOI":"10.1109\/FOCS.2010.65"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-31448-3_3","volume-title":"Information Security and Privacy","author":"H Higo","year":"2012","unstructured":"Higo, H., Tanaka, K., Yamada, A., Yasunaga, K.: A game-theoretic perspective on oblivious transfer. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol. 7372, pp. 29\u201342. Springer, Heidelberg (2012)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-41383-4_20","volume-title":"Advances in Information and Computer Security","author":"H Higo","year":"2013","unstructured":"Higo, H., Tanaka, K., Yasunaga, K.: Game-theoretic security for bit commitment. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 303\u2013318. Springer, Heidelberg (2013)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.geb.2010.05.003","volume":"71","author":"S Izmalkov","year":"2011","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Perfect implementation. Games Econ. Behav. 71(1), 121\u2013140 (2011)","journal-title":"Games Econ. Behav."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 585\u2013595 (2005)","DOI":"10.1109\/SFCS.2005.64"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-78524-8_15","volume-title":"Theory of Cryptography","author":"J Katz","year":"2008","unstructured":"Katz, J.: Bridging game theory and cryptography: recent results and future directions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 251\u2013272. Springer, Heidelberg (2008)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-78524-8_18","volume-title":"Theory of Cryptography","author":"G Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Cryptography and game theory: designing protocols for exchanging information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 320\u2013339. Springer, Heidelberg (2008)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Collusion-free protocols. In: 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 543\u2013552 (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14577-3_1","volume-title":"Financial Cryptography and Data Security","author":"U Maurer","year":"2010","unstructured":"Maurer, U.: Constructive cryptography \u2013 a primer. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, p. 1. Springer, Heidelberg (2010)"},{"key":"8_CR22","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: Second Symposium on Innovations in Computer Science (ICS 2011), pp. 1\u201321 (2011)"},{"key":"8_CR23","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical report TR-81, Aiken Computation Lab., Harvard University (1981)"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27239-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T17:51:08Z","timestamp":1748713868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27239-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272382","9783319272399"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27239-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}