{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:05:22Z","timestamp":1725757522106},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449260"},{"type":"electronic","value":"9783642449277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44927-7_10","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T01:33:06Z","timestamp":1384824786000},"page":"132-148","source":"Crossref","is-referenced-by-count":1,"title":["Defendable Security in Interaction Protocols"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Jamroga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthijs","family":"Melissen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henning","family":"Schnoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, R., Moore, T., Nagaraja, S., Ozment, A.: Incentives and information security. In: Algorithmic Game Theory (2007)","DOI":"10.1017\/CBO9780511800481.027"},{"key":"10_CR2","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":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-642-03356-8_33","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"G. Asharov","year":"2009","unstructured":"Asharov, G., Lindell, Y.: Utility dependence in correct and fair rational secret sharing. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 559\u2013576. Springer, Heidelberg (2009)"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"IT-36","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.: A fair protocol for signing contracts. IEEE Transactions on Information Theory\u00a0IT-36(1), 40\u201346 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3,4","key":"10_CR5","doi-asserted-by":"crossref","first-page":"551","DOI":"10.3233\/JCS-2004-123-408","volume":"12","author":"L. Butty\u00e1n","year":"2004","unstructured":"Butty\u00e1n, L., Hubaux, J., \u010capkun, S.: A formal model of rational exchange and its application to the analysis of Syverson\u2019s protocol. Journal of Computer Security\u00a012(3,4), 551\u2013587 (2004)","journal-title":"Journal of Computer Security"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jlap.2004.09.003","volume":"64","author":"R. Chadha","year":"2005","unstructured":"Chadha, R., Mitchell, J., Scedrov, A., Shmatikov, V.: Contract signing, optimism and advantage. Journal of Logic and Algebraic Programming\u00a064(2), 189\u2013218 (2005)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"10_CR7","unstructured":"Chatterjee, K., Raman, V.: Assume-guarantee synthesis for digital contract signing. CoRR, abs\/1004.2697 (2010)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Rabin, T.: Cryptography and game theory. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.) Algorithmic Game Theory, ch.\u00a08, pp. 181\u2013208 (2007)","DOI":"10.1017\/CBO9780511800481.010"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-15205-4_25","volume-title":"Computer Science Logic","author":"B. Finkbeiner","year":"2010","unstructured":"Finkbeiner, B., Schewe, S.: Coordination logic. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 305\u2013319. Springer, Heidelberg (2010)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-11799-2_25","volume-title":"Theory of Cryptography","author":"G. Fuchsbauer","year":"2010","unstructured":"Fuchsbauer, G., Katz, J., Naccache, D.: Efficient rational secret sharing in standard communication networks. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 419\u2013436. Springer, Heidelberg (2010)"},{"key":"10_CR11","volume-title":"A logical theory of coordination and joint ability","author":"H. Ghaderi","year":"2007","unstructured":"Ghaderi, H., Levesque, H., Lesp\u00e9rance, Y.: A logical theory of coordination and joint ability. ACM Press, New York (May 2007)"},{"key":"10_CR12","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":"10_CR13","unstructured":"Halpern, J.Y., Rong, N.: Cooperative equilibrium (extended abstract). In: Proceedings of AAMAS 2010, pp. 1465\u20131466 (2010)"},{"key":"10_CR14","unstructured":"Kremer, S., Raskin, J.: Game analysis of abuse-free contract signing. In: Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW 2002), pp. 206\u2013220. IEEE Computer Society Press (2002)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Kremer, S., Raskin, J.: A game-based verification of non-repudiation and fair exchange protocols. Journal of Computer Security\u00a011(3) (2003)","DOI":"10.3233\/JCS-2003-11307"},{"key":"10_CR16","unstructured":"Moore, T., Anderson, R.: Economics and internet security: a survey of recent analytical, empirical and behavioral research. Technical Report TR-03-11, Computer Science Group, Harvard University (2011)"},{"key":"10_CR17","unstructured":"Nash, J.: Non-cooperative games. PhD thesis, Princeton (1950)"},{"key":"10_CR18","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press (1994)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Syverson, P.: Weakly secret bit commitment: Applications to lotteries and fair exchange. In: CSFW, pp. 2\u201313 (1998)","DOI":"10.21236\/ADA464109"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2013: Principles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44927-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T20:56:58Z","timestamp":1688677018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44927-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449260","9783642449277"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44927-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}