{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T00:10:10Z","timestamp":1743984610593,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331664"},{"type":"electronic","value":"9783642331671"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","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-33167-1_6","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T10:07:05Z","timestamp":1345284425000},"page":"91-108","source":"Crossref","is-referenced-by-count":3,"title":["Deciding Epistemic and Strategic Properties of Cryptographic Protocols"],"prefix":"10.1007","author":[{"given":"Henning","family":"Schnoor","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","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.C.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013207 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"299","key":"6_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"1-3","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theoretical Computer Science\u00a01-3(299), 451\u2013475 (2003)","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Kremer, S., Raskin, J.F.: Game analysis of abuse-free contract signing. In: CSFW, p. 206. IEEE Computer Society (2002)","DOI":"10.1109\/CSFW.2002.1021817"},{"issue":"1","key":"6_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.: A fair protocol for signing contracts. IEEE Transactions on Information Theory\u00a036(1), 40\u201346 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 86\u201399. IEEE Computer Society Press (1998)","DOI":"10.1109\/SECPRI.1998.674826"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.D.: Abuse-Free Optimistic Contract Signing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 449\u2013466. Springer, Heidelberg (1999)"},{"issue":"3","key":"6_CR7","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/JCS-2003-11307","volume":"11","author":"S. Kremer","year":"2003","unstructured":"Kremer, S., Raskin, J.F.: A game-based verification of non-repudiation and fair exchange protocols. Journal of Computer Security\u00a011(3), 399\u2013430 (2003)","journal-title":"Journal of Computer Security"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM\u00a049(5), 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"K\u00e4hler, D., K\u00fcsters, R., Truderung, T.: Infinite state AMC-model checking for cryptographic protocols. In: LICS, pp. 181\u2013192. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.26"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"K\u00e4hler, D., K\u00fcsters, R., Wilke, T.: Deciding properties of contract-signing protocols. Transactions on Computational Logic (2009)","DOI":"10.1145\/1740582.1740585"},{"key":"6_CR11","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, Part II. LNCS, vol.\u00a04052, pp. 95\u2013106. Springer, Heidelberg (2006)"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology\u00a01(1), 65\u201375 (1988)","journal-title":"J. Cryptology"},{"key":"6_CR13","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":"6_CR14","unstructured":"Schnoor, H.: Explicit strategies and quantification for ATL with incomplete information and probabilistic games. Technical Report 1008, Institut f\u00fcr Informatik, Christian-Albrechts-Universit\u00e4t zu Kiel (2010)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-74407-8_5","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K. Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy Logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 59\u201373. Springer, Heidelberg (2007)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O.: On the security of multi-party ping-pong protocols. In: FOCS, pp. 34\u201339. IEEE (1983)","DOI":"10.1109\/SFCS.1983.42"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/77648.77649","volume":"8","author":"M. Burrows","year":"1990","unstructured":"Burrows, M., Abadi, M., Needham, R.M.: A logic of authentication. ACM Trans. Comput. Syst.\u00a08(1), 18\u201336 (1990)","journal-title":"ACM Trans. Comput. Syst."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Abadi, M., Tuttle, M.R.: A semantics for a logic of authentication (extended abstract). In: PODC, pp. 201\u2013216 (1991)","DOI":"10.1145\/112600.112618"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-48285-7_20","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Boyd","year":"1994","unstructured":"Boyd, C., Mao, W.: On a Limitation of BAN Logic. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 240\u2013247. Springer, Heidelberg (1994)"},{"key":"6_CR20","unstructured":"Halpern, J.Y., Pucella, R., van der Meyden, R.: Revisiting the foundations of authentication logics (manuscript)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Schnoor, H.: Deciding epistemic and strategic properties of cryptographic protocols. Technical Report 2012\/340, Cryptology ePrint Archive (2012)","DOI":"10.1007\/978-3-642-33167-1_6"},{"issue":"1-2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"367","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theoretical Computer Science\u00a0367(1-2), 2\u201332 (2006)","journal-title":"Theoretical Computer Science"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL, pp. 104\u2013115 (2001)","DOI":"10.1145\/373243.360213"},{"key":"6_CR24","unstructured":"Schnoor, H.: Strategic planning for probabilistic games with incomplete information. In: van der Hoek, W., Kaminka, G.A., Lesp\u00e9rance, Y., Luck, M., Sen, S. (eds.) AAMAS. IFAAMAS, pp. 1057\u20131064 (2010)"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1145\/153724.153770","volume":"40","author":"J.Y. Halpern","year":"1993","unstructured":"Halpern, J.Y., Tuttle, M.R.: Knowledge, probability, and adversaries. J. ACM\u00a040(4), 917\u2013962 (1993)","journal-title":"J. ACM"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-15497-3_24","volume-title":"Computer Security \u2013 ESORICS 2010","author":"S. Kremer","year":"2010","unstructured":"Kremer, S., Ryan, M., Smyth, B.: Election Verifiability in Electronic Voting Protocols. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 389\u2013404. Springer, Heidelberg (2010)"},{"issue":"3","key":"6_CR27","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.elerap.2008.04.006","volume":"7","author":"D.C. Parkes","year":"2008","unstructured":"Parkes, D.C., Rabin, M.O., Shieber, S.M., Thorpe, C.: Practical secrecy-preserving, verifiably correct and trustworthy auctions. Electronic Commerce Research and Applications\u00a07(3), 294\u2013312 (2008)","journal-title":"Electronic Commerce Research and Applications"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: Accountability: Definition and relationship to verifiability. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM Conference on Computer and Communications Security, pp. 526\u2013535. ACM (2010)","DOI":"10.1145\/1866307.1866366"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: A game-based definition of coercion-resistance and its applications. In: CSF, pp. 122\u2013136. IEEE Computer Society (2010)","DOI":"10.1109\/CSF.2010.16"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T.: An epistemic approach to coercion-resistance for electronic voting protocols. In: IEEE Symposium on Security and Privacy, pp. 251\u2013266. IEEE Computer Society (2009)","DOI":"10.1109\/SP.2009.13"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33167-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T23:43:35Z","timestamp":1743983015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33167-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331664","9783642331671"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33167-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}