{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T07:14:42Z","timestamp":1790925282972,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540894384","type":"print"},{"value":"9783540894391","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_9","type":"book-chapter","created":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T22:03:10Z","timestamp":1226700190000},"page":"128-142","source":"Crossref","is-referenced-by-count":15,"title":["From One Session to Many: Dynamic Tags for Security Protocols"],"prefix":"10.1007","author":[{"given":"Myrto","family":"Arapinis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve","family":"Kremer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Delaune, S., Kremer, S.: From one session to many: Dynamic tags for security protocols. Research Report LSV-08-20, ENS Cachan, France, 30\u00a0pages (June 2008)","DOI":"10.1007\/978-3-540-89439-1_9"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-77050-3_31","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"M. Arapinis","year":"2007","unstructured":"Arapinis, M., Duflot, M.: Bounding messages for free in security protocols. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 376\u2013387. Springer, Heidelberg (2007)"},{"key":"9_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., et al.: 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":"9_CR4","unstructured":"Beauquier, D., Gauche, F.: How to guarantee secrecy for cryptographic protocols. CoRR, abs\/cs\/0703140 (2007)"},{"key":"9_CR5","first-page":"419","volume-title":"Proc. 30th Annual ACM Symposium on the Theory of Computing (STOC 1998)","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract). In: Proc. 30th Annual ACM Symposium on the Theory of Computing (STOC 1998), pp. 419\u2013428. ACM Press, New York (1998)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-36576-1_9","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Blanchet","year":"2003","unstructured":"Blanchet, B., Podelski, A.: Verification of cryptographic protocols: Tagging enforces termination. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 136\u2013152. Springer, Heidelberg (2003)"},{"key":"9_CR7","unstructured":"Clark, J., Jacob, J.: A survey of authentication protocol literature (1997)"},{"key":"9_CR8","unstructured":"Comon, H.: R\u00e9solution de contraintes et recherche d\u2019attaques pour un nombre born\u00e9 de sessions, http:\/\/www.lsv.ens-cachan.fr\/~comon\/CRYPTO\/bounded.ps"},{"issue":"1-3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.scico.2003.12.002","volume":"50","author":"H. Comon-Lundh","year":"2004","unstructured":"Comon-Lundh, H., Cortier, V.: Security properties: two agents are sufficient. Science of Computer Programming\u00a050(1-3), 51\u201371 (2004)","journal-title":"Science of Computer Programming"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-77050-3_29","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"V. Cortier","year":"2007","unstructured":"Cortier, V., Delaitre, J., Delaune, S.: Safely composing security protocols. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 352\u2013363. Springer, Heidelberg (2007)"},{"key":"9_CR11","unstructured":"Cortier, V., Delaune, S.: Safely composing security protocols. Research Report LSV-08-06, ENS Cachan, France, 39\u00a0pages (March 2008)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-540-74835-9_27","volume-title":"Computer Security \u2013 ESORICS 2007","author":"V. Cortier","year":"2007","unstructured":"Cortier, V., Warinschi, B., Z\u0103linescu, E.: Synthesizing secure protocols. In: Biskup, J., L\u00f3pez, J. (eds.) ESORICS 2007. LNCS, vol.\u00a04734, pp. 406\u2013421. Springer, Heidelberg (2007)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11916277_22","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Z\u0103linescu, E.: Deciding key cycles for security protocols. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS, vol.\u00a04246, pp. 317\u2013331. Springer, Heidelberg (2006)"},{"key":"9_CR14","unstructured":"Delaune, S.: Note: Constraint solving procedure, http:\/\/www.lsv.ens-cachan.fr\/Publis\/PAPERS\/PDF\/CDD-fsttcs07-addendum.pdf"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Dolev, D., Even, S., Karp, R.M.: On the security of ping-pong protocols. In: Proc. Advances in Cryptology (CRYPTO 1982), pp. 177\u2013186 (1982)","DOI":"10.1016\/S0019-9958(82)90401-6"},{"key":"9_CR16","volume-title":"Proc. of the 22nd Symposium on Foundations of Computer Science (FOCS 1981)","author":"D. Dolev","year":"1981","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. In: Proc. of the 22nd Symposium on Foundations of Computer Science (FOCS 1981). IEEE Comp. Soc. Press, Los Alamitos (1981)"},{"key":"9_CR17","unstructured":"Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: Undecidability of bounded security protocols. In: Proc. Workshop on Formal Methods and Security Protocols (1999)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/CSFW.2000.856942","volume-title":"Proc. 13th Computer Security Foundations Workshop (CSFW 2001)","author":"J. Heather","year":"2000","unstructured":"Heather, J., Lowe, G., Schneider, S.: How to prevent type flaw attacks on security protocols. In: Proc. 13th Computer Security Foundations Workshop (CSFW 2001), pp. 255\u2013268. IEEE Comp. Soc. Press, Los Alamitos (2000)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-45146-4_7","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Katz","year":"2003","unstructured":"Katz, J., Yung, M.: Scalable protocols for authenticated group key exchange. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 110\u2013125. Springer, Heidelberg (2003)"},{"key":"9_CR20","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":"9_CR21","doi-asserted-by":"crossref","unstructured":"Lowe, G.: Towards a completeness result for model checking of security protocols. Journal of Computer Security\u00a07(1) (1999)","DOI":"10.3233\/JCS-1999-72-302"},{"key":"9_CR22","volume-title":"Proc. 8th ACM Conference on Computer and Communications Security (CCS 2001)","author":"J. Millen","year":"2001","unstructured":"Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proc. 8th ACM Conference on Computer and Communications Security (CCS 2001). ACM Press, New York (2001)"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-24597-1_31","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"R. Ramanujam","year":"2003","unstructured":"Ramanujam, R., Suresh, S.P.: Tagging makes secrecy decidable for unbounded nonces as well. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 363\u2013374. Springer, Heidelberg (2003)"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.3233\/JCS-2005-13106","volume":"13","author":"R. Ramanujam","year":"2005","unstructured":"Ramanujam, R., Suresh, S.P.: Decidability of context-explicit security protocols. Journal of Computer Security\u00a013(1), 135\u2013165 (2005)","journal-title":"Journal of Computer Security"},{"issue":"1-3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"299","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions and composed keys is NP-complete. Theoretical Computer Science\u00a0299(1-3), 451\u2013475 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89439-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:12:15Z","timestamp":1557911535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}