{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:52:06Z","timestamp":1743047526596,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642224379"},{"type":"electronic","value":"9783642224386"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22438-6_6","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T22:21:44Z","timestamp":1311027704000},"page":"49-63","source":"Crossref","is-referenced-by-count":8,"title":["Deciding Security for Protocols with Recursive Tests"],"prefix":"10.1007","author":[{"given":"Mathilde","family":"Arnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Cortier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"387","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theoretical Computer Science\u00a0387(1-2), 2\u201332 (2006)","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","unstructured":"Andel, T.R., Yasinsac, A.: Automated security analysis of ad hoc routing protocols. In: Proc. of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA 2007), pp. 9\u201326 (2007)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"Computer Aided Verification","author":"A. Armando","year":"2005","unstructured":"Armando, A., Basin, D., Boichut, Y., Chevalier, Y., Compagna, L., Cuellar, J., Drielsma, P.H., He\u00e1m, P.C., Kouchnarenko, O., Mantovani, J., M\u00f6dersheim, S., von Oheimb, D., Rusinowitch, M., Santiago, J., Turuani, M., Vigan\u00f2, L., Vigneron, L.: The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 281\u2013285. Springer, Heidelberg (2005)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Armando, A., Carbone, R., Compagna, L., Cu\u00e9llar, J., Tobarra, M.L.: Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps. In: Proc. of the 6th ACM Workshop on Formal Methods in Security Engineering (FMSE 2008), pp. 1\u201310 (2008)","DOI":"10.1145\/1456396.1456397"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Arnaud, M., Cortier, V., Delaune, S.: Deciding security for protocols with recursive tests. Research Report LSV-11-05, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France, p. 46 (April 2011)","DOI":"10.1007\/978-3-642-22438-6_6"},{"issue":"17","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1016\/S0140-3664(00)00249-8","volume":"23","author":"N. Asokan","year":"2000","unstructured":"Asokan, N., Ginzboorg, P.: Key agreement in ad hoc networks. Computer Communications\u00a023(17), 1627\u20131637 (2000)","journal-title":"Computer Communications"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-48749-2_9","volume-title":"Secure Internet Programming","author":"T. Aura","year":"1999","unstructured":"Aura, T.: Distributed access-rights management with delegation certificates. In: Ryan, M. (ed.) Secure Internet Programming. LNCS, vol.\u00a01603, pp. 211\u2013235. Springer, Heidelberg (1999)"},{"key":"6_CR8","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Automated Deduction \u2013 CADE-20","author":"B. Blanchet","year":"2005","unstructured":"Blanchet, B.: An automatic security protocol verifier based on resolution theorem proving (invited tutorial). In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, Springer, Heidelberg (2005)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/1029102.1029119","volume-title":"Proc. of the 2nd ACM workshop on Security of ad hoc and sensor networks (SASN 2004)","author":"L. Butty\u00e1n","year":"2004","unstructured":"Butty\u00e1n, L., Vajda, I.: Towards Provable Security for Ad Hoc Routing Protocols. In: Proc. of the 2nd ACM workshop on Security of ad hoc and sensor networks (SASN 2004), pp. 94\u2013105. ACM, New York (2004)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Chridi, N., Turuani, M., Rusinowitch, M.: Decidable analysis for a class of cryptographic group protocols with unbounded lists. In: Proc. of the 22nd IEEE Computer Security Foundations Symposium (CSF 2009), pp. 277\u2013289 (2009)","DOI":"10.1109\/CSF.2009.10"},{"issue":"4","key":"6_CR11","first-page":"496","volume":"11","author":"H. Comon-Lundh","year":"2010","unstructured":"Comon-Lundh, H., Cortier, V., Zalinescu, E.: Deciding security properties for cryptographic protocols. Application to key cycles. ACM Transactions on Computational Logic (TOCL)\u00a011(4), 496\u2013520 (2010)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"6_CR12","unstructured":"Feng, T., Guo, X., Ma, J., Li, X.: UC-Secure Source Routing Protocol (2009)"},{"key":"6_CR13","unstructured":"Housley, R., Ford, W., Polk, W.: X.509 certificate and CRL profile. IETF standard, RFC 2459 (1998)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11276-004-4744-y","volume":"11","author":"Y.-C. Hu","year":"2005","unstructured":"Hu, Y.-C., Perrig, A., Johnson, D.: Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks. Wireless Networks\u00a011, 21\u201338 (2005)","journal-title":"Wireless Networks"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-540-70918-3_55","volume-title":"STACS 2007","author":"R. K\u00fcsters","year":"2007","unstructured":"K\u00fcsters, R., Truderung, T.: On the Automatic Analysis of Recursive Security Protocols with XOR. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 646\u2013657. Springer, Heidelberg (2007)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proc. of the 8th ACM Conference on Computer and Communications Security (CCS 2001), pp. 166\u2013175 (2001)","DOI":"10.1145\/501983.502007"},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/CSFW.1997.596790","volume-title":"Proc. of the 10th IEEE Computer Security Foundations Workshop","author":"L.C. Paulson","year":"1997","unstructured":"Paulson, L.C.: Mechanized proofs for a recursive authentication protocol. In: Proc. of the 10th IEEE Computer Security Foundations Workshop, pp. 84\u201395. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/CSFW.2001.930145","volume-title":"Proc. of the 14th Computer Security Foundations Workshop (CSFW 2001)","author":"M. Rusinowitch","year":"2001","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proc. of the 14th Computer Security Foundations Workshop (CSFW 2001), pp. 174\u2013190. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"6_CR21","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)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-23"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22438-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,28]],"date-time":"2021-11-28T08:13:40Z","timestamp":1638087220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22438-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642224379","9783642224386"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22438-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}