{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:04:17Z","timestamp":1725570257247},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161605"},{"type":"electronic","value":"9783642161612"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16161-2_28","type":"book-chapter","created":{"date-parts":[[2010,11,26]],"date-time":"2010-11-26T22:17:14Z","timestamp":1290809834000},"page":"484-497","source":"Crossref","is-referenced-by-count":2,"title":["A Formal Definition of Online Abuse-Freeness"],"prefix":"10.1007","author":[{"given":"Ralf","family":"K\u00fcsters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henning","family":"Schnoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Truderung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","first-page":"104","volume-title":"POPL 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: POPL 2001, pp. 104\u2013115. ACM Press, New York (2001)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-642-04444-1_35","volume-title":"Computer Security \u2013 ESORICS 2009","author":"M. Aizatulin","year":"2009","unstructured":"Aizatulin, M., Schnoor, H., Wilke, T.: Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol.\u00a05789, pp. 571\u2013586. Springer, Heidelberg (2009)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: IEEE Symposium on Research in Security and Privacy, pp. 86\u201399 (1998)","DOI":"10.1109\/SECPRI.1998.674826"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.L.: Fair protocol for signing contracts. IEEE Transactions on Information Theory\u00a036(1), 40\u201346 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR5","first-page":"176","volume-title":"CCS 2001","author":"R. Chadha","year":"2001","unstructured":"Chadha, R., Kanovich, M.I., Scedrov, A.: Inductive methods and contract-signing protocols. In: CCS 2001, pp. 176\u2013185. ACM Press, New York (2001)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-45187-7_24","volume-title":"CONCUR 2003 - Concurrency Theory","author":"R. Chadha","year":"2003","unstructured":"Chadha, R., Mitchell, J.C., Scedrov, A., Shmatikov, V.: Contract Signing, Optimism, and Advantage. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 361\u2013377. Springer, Heidelberg (2003)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-74835-9_28","volume-title":"Computer Security \u2013 ESORICS 2007","author":"V. Cortier","year":"2007","unstructured":"Cortier, V., K\u00fcsters, R., Warinschi, B.: A cryptographic model for branching time security properties \u2013 the case of contract signing protocols. In: Biskup, J., L\u00f3pez, J. (eds.) ESORICS 2007. LNCS, vol.\u00a04734, pp. 422\u2013437. Springer, Heidelberg (2007)"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the Security of Public-Key Protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-48405-1_29","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J.A. Garay","year":"1999","unstructured":"Garay, J.A., Jakobsson, M., MacKenzie, P.: Abuse-free optimistic contract signing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 449\u2013466. Springer, Heidelberg (1999)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"K\u00e4hler, D., K\u00fcsters, R.: Constraint Solving for Contract-Signing Protocols. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 233\u2013247. Springer, Heidelberg (2005)","DOI":"10.1007\/11539452_20"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-31856-9_13","volume-title":"STACS 2005","author":"D. K\u00e4hler","year":"2005","unstructured":"K\u00e4hler, D., K\u00fcsters, R., Wilke, T.: Deciding Properties of Contract-Signing Protocols. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 158\u2013169. Springer, Heidelberg (2005)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11787006_9","volume-title":"Automata, Languages and Programming","author":"D. K\u00e4hler","year":"2006","unstructured":"K\u00e4hler, D., K\u00fcsters, R., Wilke, T.: A Dolev-Yao-based Definition of Abuse-free Protocols. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 95\u2013106. Springer, Heidelberg (2006)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Kremer, S., Raskin, J.-F.: Game analysis of abuse-free contract signing. In: CSFW 2002 (2002)","DOI":"10.1109\/CSFW.2002.1021817"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Schnoor, H., Truderung, T.: A Formal Definition of Online Abuse-freeness. Technical Report, University of Trier (2010), http:\/\/infsec.uni-trier.de\/publications.html","DOI":"10.1007\/978-3-642-16161-2_28"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T.: An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols. In: Security and Privacy 2009, pp. 251\u2013266. IEEE Computer Society, Los Alamitos (2009)","DOI":"10.1109\/SP.2009.13"},{"issue":"2","key":"28_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/S0304-3975(01)00141-4","volume":"283","author":"V. Shmatikov","year":"2002","unstructured":"Shmatikov, V., Mitchell, J.C.: Finite-state analysis of two contract signing protocols. Theoretical Computer Science (TCS), special issue on Theoretical Foundations of Security Analysis and Design\u00a0283(2), 419\u2013450 (2002)","journal-title":"Theoretical Computer Science (TCS), special issue on Theoretical Foundations of Security Analysis and Design"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/TIFS.2009.2035972","volume":"5","author":"G. Wang","year":"2010","unstructured":"Wang, G.: An Abuse-Free Fair Contract-Signing Protocol Based on the RSA Signature. IEEE Transactions on Information Forensics and Security\u00a05(1), 158\u2013168 (2010)","journal-title":"IEEE Transactions on Information Forensics and Security"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16161-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T11:45:30Z","timestamp":1559821530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16161-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161605","9783642161612"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16161-2_28","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2010]]}}}