{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:39:13Z","timestamp":1725755953132},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642413827"},{"type":"electronic","value":"9783642413834"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41383-4_20","type":"book-chapter","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T09:37:33Z","timestamp":1384162653000},"page":"303-318","source":"Crossref","is-referenced-by-count":2,"title":["Game-Theoretic Security for Bit Commitment"],"prefix":"10.1007","author":[{"given":"Haruna","family":"Higo","sequence":"first","affiliation":[]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[]},{"given":"Kenji","family":"Yasunaga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","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.\u00a06632, pp. 426\u2013445. Springer, Heidelberg (2011)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-17373-8_16","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"K.-M. Chung","year":"2010","unstructured":"Chung, K.-M., Liu, F.-H., Lu, C.-J., Yang, B.-Y.: Efficient string-commitment from weak bit-commitment. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 268\u2013282. Springer, Heidelberg (2010)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Katz, J., Naccache, D.: Efficient rational secret sharing in standard communication networks. In: Micciancio (ed.) [14], pp. 419\u2013436","DOI":"10.1007\/978-3-642-11799-2_25"},{"key":"20_CR4","unstructured":"Fudenberg, D., Tirole, J.: Game theory (3. pr.). MIT Press (1991)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The foundations of cryptography, vol. 2. Basic applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Gradwohl, R.: Rationality in the full-information model. In: Micciancio (ed.) [14], pp. 401\u2013418","DOI":"10.1007\/978-3-642-11799-2_24"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-29011-4_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Groce","year":"2012","unstructured":"Groce, A., Katz, J.: Fair computation with rational players. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 81\u201398. Springer, Heidelberg (2012)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-31585-5_50","volume-title":"Automata, Languages, and Programming","author":"A. Groce","year":"2012","unstructured":"Groce, A., Katz, J., Thiruvengadam, A., Zikas, V.: Byzantine agreement with a rational adversary. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 561\u2013572. Springer, Heidelberg (2012)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: Babai, L. (ed.) STOC, pp. 623\u2013632. ACM (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"20_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient secure two-party protocols: techniques and constructions","author":"C. Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient secure two-party protocols: techniques and constructions, 1st edn. Springer-Verlag New York, Inc., New York (2010)","edition":"1"},{"key":"20_CR11","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.\u00a07372, pp. 29\u201342. Springer, Heidelberg (2012)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-36594-2_15","volume-title":"Theory of Cryptography","author":"R.A. Jeffs","year":"2013","unstructured":"Jeffs, R.A., Rosulek, M.: Characterizing the cryptographic properties of reactive 2-party functionalities. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 263\u2013280. Springer, Heidelberg (2013)"},{"key":"20_CR13","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.\u00a04948, pp. 251\u2013272. Springer, Heidelberg (2008)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","year":"2010","unstructured":"Micciancio, D. (ed.): TCC 2010. LNCS, vol.\u00a05978. Springer, Heidelberg (2010)"},{"key":"20_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic game theory. Cambridge University Press, New York (2007)"},{"key":"20_CR16","unstructured":"Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press (1994)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-32928-9_23","volume-title":"Security and Cryptography for Networks","author":"K. Yasunaga","year":"2012","unstructured":"Yasunaga, K.: Public-key encryption with lazy parties. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol.\u00a07485, pp. 411\u2013425. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41383-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T18:04:34Z","timestamp":1596823474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41383-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642413827","9783642413834"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41383-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}