{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:11:29Z","timestamp":1740287489844,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_13","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"128-141","source":"Crossref","is-referenced-by-count":10,"title":["Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions"],"prefix":"10.1007","author":[{"given":"Yannick","family":"Chevalier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"K\u00fcsters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u00ebl","family":"Rusinowitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Turuani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-45694-5_33","volume-title":"CONCUR 2002 - Concurrency Theory","author":"R.M. Amadio","year":"2002","unstructured":"Amadio, R.M., Charatonik, W.: On Name Generation and Set-Based Analysis in the Dolev-Yao Model. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 499\u2013514. Springer, Heidelberg (2002)"},{"key":"13_CR2","unstructured":"Amadio, R.M., Lugiez, D., Vanack\u2018ere, V.: On the symbolic reduction of processes with cryptographic functions. Technical Report RR-4147, INRIA (2001)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-45657-0_27","volume-title":"Computer Aided Verification","author":"A. Armando","year":"2002","unstructured":"Armando, A., Basin, D., Bouallagui, M., Chevalier, Y., Compagna, L., M\u00f6dersheim, S., Rusinowitch, M., Turuani, M., Vigan\u00f2, L., Vigneron, L.: The AVISS Security Protocol Analysis Tool. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 349\u2013353. Springer, Heidelberg (2002)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M., Vigneron, L.: Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions (to appear), Technical Report available at http:\/\/www.inria.fr\/rrrt\/liste-2003.html","DOI":"10.1007\/978-3-540-45220-1_13"},{"key":"13_CR5","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: An NP decision procedure for protocol insecurity with XOR. In: Proceedings of LICS 2003 (2003) (to appear)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45657-0_24","volume-title":"Computer Aided Verification","author":"Y. Chevalier","year":"2002","unstructured":"Chevalier, Y., Vigneron, L.: Automated unbounded verification of security protocols. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 324. Springer, Heidelberg (2002)"},{"key":"13_CR7","unstructured":"Clark, J., Jacob, J.: A Survey of Authentication Protocol Literature (1997), Web Draft Version 1.0, available from http:\/\/citeseer.nj.nec.com\/"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 firstorder logic and application to cryptographic protocols. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, Springer, Heidelberg (2003) (to appear)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Comon, H., Shmatikov, V.: Is it possible to decide whether a cryptographic protocol is secure or not? Journal of Telecommunications and Information Technology (2002) (to appear)","DOI":"10.26636\/jtit.2002.4.149"},{"key":"13_CR10","first-page":"82","volume-title":"CCC 1997","author":"E. Dantsin","year":"1997","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. In: CCC 1997, pp. 82\u2013101. IEEE Computer Society, Los Alamitos (1997)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0019-9958(82)90401-6","volume":"55","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Even, S., Karp, R.M.: On the Security of Ping-Pong Protocols. Information and Control\u00a055, 57\u201368 (1982)","journal-title":"Information and Control"},{"issue":"2","key":"13_CR12","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":"13_CR13","unstructured":"Durgin, N.A., Lincoln, P.D., Mitchell, J.C., Scedrov, A.: Undecidability of bounded security protocols. In: Workshop on Formal Methods and Security Protocols, FMSP 1999 (1999)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O.: On the Security of Multi-Party Ping-Pong Protocols. In: FOCS 1983, pp. 34\u201339 (1983)","DOI":"10.1109\/SFCS.1983.42"},{"key":"13_CR15","unstructured":"Huima, A.: Efficient infinite-state analysis of security protocols. In: Workshop on Formal Methods and Security Protocols (FMSP 1999) (1999)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-45694-5_34","volume-title":"CONCUR 2002 - Concurrency Theory","author":"R. K\u00fcsters","year":"2002","unstructured":"K\u00fcsters, R.: On the decidability of cryptographic protocols with open-ended data structures. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 515\u2013530. Springer, Heidelberg (2002)"},{"key":"13_CR17","first-page":"237","volume-title":"DISCEX 2000","author":"C. Meadows","year":"2000","unstructured":"Meadows, C.: Open issues in formal methods for cryptographic protocol analysis. In: DISCEX 2000, pp. 237\u2013250. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/501983.502007","volume-title":"CCS 2001","author":"J.K. Millen","year":"2001","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: CCS 2001, pp. 166\u2013175. ACM Press, New York (2001)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Rusinowitch, M., Turuani, M.: Protocol Insecurity with Finite Number of Sessions is NP-complete. In: CSFW-14, pp. 174\u2013190 (2001)","DOI":"10.1109\/CSFW.2001.930145"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T07:59:57Z","timestamp":1740211197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}