{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:52Z","timestamp":1725511792093},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_55","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"646-657","source":"Crossref","is-referenced-by-count":8,"title":["On the Automatic Analysis of Recursive Security Protocols with XOR"],"prefix":"10.1007","author":[{"given":"Ralf","family":"K\u00fcsters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Truderung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","unstructured":"Bull, J.A., Otway, D.J.: The authentication protocol. Technical Report DRA\/CIS3\/PROJ\/CORBA\/SC\/1\/CSM\/436-04\/03, Defence Research Agency, Malvern, UK (1997)"},{"key":"55_CR2","first-page":"261","volume-title":"LICS 2003","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., et al.: An NP Decision Procedure for Protocol Insecurity with XOR. In: LICS 2003, pp. 261\u2013270. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"55_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-540-24597-1_11","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., et al.: Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 124\u2013135. Springer, Heidelberg (2003)"},{"issue":"1","key":"55_CR4","first-page":"55","volume":"125","author":"Y. Chevalier","year":"2005","unstructured":"Chevalier, Y., et al.: Deciding the Security of Protocols with Commuting Public Key Encryption. ENTCS\u00a0125(1), 55\u201366 (2005)","journal-title":"ENTCS"},{"key":"55_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-44881-0_12","volume-title":"Rewriting Techniques and Applications","author":"H. Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Cortier, V.: New Decidability Results for Fragments of First-order Logic and Application to Cryptographic Protocols. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 148\u2013164. Springer, Heidelberg (2003)"},{"key":"55_CR6","first-page":"271","volume-title":"LICS 2003","author":"H. Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: LICS 2003, pp. 271\u2013280. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"1","key":"55_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/JCS-2006-14101","volume":"14","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security\u00a014(1), 1\u201343 (2006)","journal-title":"Journal of Computer Security"},{"issue":"1\u20132","key":"55_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10207-004-0050-z","volume":"4","author":"R. K\u00fcsters","year":"2005","unstructured":"K\u00fcsters, R.: On the Decidability of Cryptographic Protocols with Open-ended Data Structures. International Journal of Information Security\u00a04(1\u20132), 49\u201370 (2005)","journal-title":"International Journal of Information Security"},{"key":"55_CR9","unstructured":"K\u00fcsters, R., Truderung, T.: On the Automatic Analysis of Recursive Security Protocols with XOR. Technial Report (2007), Available from \n                    \n                      http:\/\/people.inf.ethz.ch\/kuestral\/publications_html\/KuestersTruderung-TR-STACS-2007.pdf"},{"key":"55_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/978-3-540-24749-4_34","volume-title":"STACS 2004","author":"R. K\u00fcsters","year":"2004","unstructured":"K\u00fcsters, R., Wilke, T.: Automata-based Analysis of Recursive Cryptographic Protocols. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 382\u2013393. Springer, Heidelberg (2004)"},{"key":"55_CR11","first-page":"84","volume-title":"CSFW-10","author":"L.C. Paulson","year":"1997","unstructured":"Paulson, L.C.: Mechanized Proofs for a Recursive Authentication Protocol. In: CSFW-10, pp. 84\u201395. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"55_CR12","first-page":"73","volume-title":"CSFW-14","author":"O. Pereira","year":"2001","unstructured":"Pereira, O., Quisquater, J.-J.: A Security Analysis of the Cliques Protocols Suites. In: CSFW-14, pp. 73\u201381. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"1","key":"55_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(97)00180-4","volume":"65","author":"P.Y.A. Ryan","year":"1998","unstructured":"Ryan, P.Y.A., Schneider, S.A.: An Attack on a Recursive Authentication Protocol. Information Processing Letters\u00a065(1), 7\u201310 (1998)","journal-title":"Information Processing Letters"},{"key":"55_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-540-24725-8_25","volume-title":"Programming Languages and Systems","author":"V. Shmatikov","year":"2004","unstructured":"Shmatikov, V.: Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 355\u2013369. Springer, Heidelberg (2004)"},{"key":"55_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11539452_19","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"T. Truderung","year":"2005","unstructured":"Truderung, T.: Selecting theories and recursive protocols. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 217\u2013232. Springer, Heidelberg (2005)"},{"key":"55_CR16","series-title":"Lecture Notes in Computer Science","first-page":"337","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"K.N. Verma","year":"2004","unstructured":"Verma, K.N., Seidl, H., Schwentick, T.: On the complexity of equational horn clauses. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 337\u2013352. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:00Z","timestamp":1605762720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_55","relation":{},"subject":[]}}