{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:55:30Z","timestamp":1760079330961,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T00:00:00Z","timestamp":1193961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,11,2]]},"DOI":"10.1145\/1314436.1314445","type":"proceedings-article","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T14:30:20Z","timestamp":1195137020000},"page":"61-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Selecting theories and nonce generation for recursive protocols"],"prefix":"10.1145","author":[{"given":"Klaas","family":"Ole K\u00fcrtz","sequence":"first","affiliation":[{"name":"Christian-Albrechts-Universit\u00e4t, Kiel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"K\u00fcsters","sequence":"additional","affiliation":[{"name":"ETH Zurich, ETH, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Wilke","sequence":"additional","affiliation":[{"name":"Christian-Albrechts-Universit\u00e4t, Kiel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,11,2]]},"reference":[{"key":"e_1_3_2_1_2_1","volume-title":"Tree Automata Techniques and Applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata","author":"Comon H.","year":"1997","unstructured":"H. Comon , M. Dauchet , R. Gilleron , F. Jacquemard , D. Lugiez , S. Tison , and M. Tommasi . Tree Automata Techniques and Applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata , 1997 . release October, 1rst 2002. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata, 1997. release October, 1rst 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759148.1759161"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_5_1","volume-title":"A Cryptographic Evaluation of IPsec. Technical report","author":"Ferguson N.","year":"2000","unstructured":"N. Ferguson and B. Schneier . A Cryptographic Evaluation of IPsec. Technical report , 2000 . Available from http:\/\/www.counterpane.com\/ipsec.pdf. N. Ferguson and B. Schneier. A Cryptographic Evaluation of IPsec. Technical report, 2000. Available from http:\/\/www.counterpane.com\/ipsec.pdf."},{"key":"e_1_3_2_1_6_1","volume-title":"November","author":"Harkins D.","year":"1998","unstructured":"D. Harkins and D. Carrel . The Internet Key Exchange (IKE) , November 1998 . RFC 2409. D. Harkins and D. Carrel. The Internet Key Exchange (IKE), November 1998. RFC 2409."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"R.\n      K\u00fcsters\n    .\n  On the Decidability of Cryptographic Protocols with Open-ended Data Structures\n  . In L. Brim P. Jancar M. Kretinsky and A. Kucera editors 13th International Conference on Concurrency Theory (CONCUR \n  2002\n  ) volume \n  2421\n   of \n  Lecture Notes in Computer Science pages \n  515\n  --\n  530\n  . \n  Springer-Verlag 2002.   R. K\u00fcsters. On the Decidability of Cryptographic Protocols with Open-ended Data Structures. In L. Brim P. Jancar M. Kretinsky and A. Kucera editors 13th International Conference on Concurrency Theory (CONCUR 2002) volume 2421 of Lecture Notes in Computer Science pages 515--530. Springer-Verlag 2002.","DOI":"10.1007\/3-540-45694-5_34"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-004-0050-z"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"R.\n      K\u00fcsters\n     and \n      T.\n      Wilke\n  . \n  Automata-based Analysis of Recursive Cryptographic Protocols\n  . In V. Diekert and M. Habib editors 21st Symposium on Theoretical Aspects of Computer Science (STACS \n  2004\n  ) volume \n  2996\n   of \n  Lecture Notes in Computer Science pages \n  382\n  --\n  393\n  . \n  Springer-Verlag 2004.  R. K\u00fcsters and T. Wilke. Automata-based Analysis of Recursive Cryptographic Protocols. In V. Diekert and M. Habib editors 21st Symposium on Theoretical Aspects of Computer Science (STACS 2004) volume 2996 of Lecture Notes in Computer Science pages 382--393. Springer-Verlag 2004.","DOI":"10.1007\/978-3-540-24749-4_34"},{"key":"e_1_3_2_1_11_1","first-page":"237","volume-title":"Proceedings of DISCEX 2000","author":"Meadows C.","year":"2000","unstructured":"C. Meadows . Open issues in formal methods for cryptographic protocol analysis . In Proceedings of DISCEX 2000 , pages 237 -- 250 . IEEE Computer Society Press , 2000 . C. Meadows. Open issues in formal methods for cryptographic protocol analysis. In Proceedings of DISCEX 2000, pages 237--250. IEEE Computer Society Press, 2000."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/24592.24594"},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS","author":"K\u00fcsters R.","year":"2007","unstructured":"R. K\u00fcsters and T. Truderung . On the Automatic Analysis of Recursive Security Protocols with XOR . In W. Thomas and P. Weil, editors, Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS 2007 ), volume 4393 of Lecture Notes in Computer Science . Springer , 2007. R. K\u00fcsters and T. Truderung. On the Automatic Analysis of Recursive Security Protocols with XOR. In W. Thomas and P. Weil, editors, Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS 2007), volume 4393 of Lecture Notes in Computer Science. Springer, 2007."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11532231_28"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_19"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11532231_25"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:19990747"}],"event":{"name":"CCS07: 14th ACM Conference on Computer and Communications Security 2007","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Fairfax Virginia USA","acronym":"CCS07"},"container-title":["Proceedings of the 2007 ACM workshop on Formal methods in security engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1314436.1314445","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1314436.1314445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:04Z","timestamp":1750254964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1314436.1314445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,2]]},"references-count":15,"alternative-id":["10.1145\/1314436.1314445","10.1145\/1314436"],"URL":"https:\/\/doi.org\/10.1145\/1314436.1314445","relation":{},"subject":[],"published":{"date-parts":[[2007,11,2]]},"assertion":[{"value":"2007-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}