{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:40:30Z","timestamp":1774946430512,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540206804","type":"print"},{"value":"9783540245971","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_31","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T03:39:20Z","timestamp":1280374760000},"page":"363-374","source":"Crossref","is-referenced-by-count":21,"title":["Tagging Makes Secrecy Decidable with Unbounded Nonces as Well"],"prefix":"10.1007","author":[{"given":"R.","family":"Ramanujam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. P.","family":"Suresh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Amadio, R.M., Lugiez, D., Vanack\u00e8re, V.: On the symbolic reduction of processes with cryptographic functions, INRIA Research Report 4147 (March 2001)"},{"key":"31_CR2","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, P.: Verification of Cryptographic Protocols: Tagging Enforces Termination. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 136\u2013152. Springer, Heidelberg (2003)"},{"key":"31_CR3","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 firstorder logic and applications to cryptographic protocols. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 148\u2013164. Springer, Heidelberg (2003)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/3-540-48224-5_56","volume-title":"Automata, Languages and Programming","author":"H. Comon-Lundh","year":"2001","unstructured":"Comon-Lundh, H., Cortier, V., Mitchell, J.C.: Tree automata with One Memory, Set Constraints, and Ping-Pong Protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, p. 682. Springer, Heidelberg (2001)"},{"key":"31_CR5","unstructured":"Clark, J., Jacob, J.: A survey of authentication protocol literature (1997), Electronic version available at \n                    \n                      http:\/\/www.cs.york.ac.uk\/~jac"},{"key":"31_CR6","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"},{"key":"31_CR7","unstructured":"Durgin, N.A., Lincoln, P.D., Mitchell, J.C., Scedrov, A.: The undecidability of bounded security protocols. In: Proc. FMSP 1999 (1999)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Heather, J., Lowe, G., Schneider, S.: How to Prevent Type Flaw Attacks on Security Protocols. In: Proc. 13th IEEE CSFW, pp. 255\u2013268 (2000)","DOI":"10.1109\/CSFW.2000.856942"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/32.481514","volume":"22","author":"N. Heintze","year":"1996","unstructured":"Heintze, N., Tygar, D.: A model for secure protocols and their composition. IEEE Transactions on Software Engineering\u00a022, 16\u201330 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/JCS-1999-72-302","volume":"7","author":"G. Lowe","year":"1999","unstructured":"Lowe, G.: Towards a completeness result for model checking of security protocols. Journal of computer security\u00a07, 89\u2013146 (1999)","journal-title":"Journal of computer security"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proc. ACM Conf. on Computer and Communications Security, pp. 166\u2013175 (2001)","DOI":"10.1145\/501983.502007"},{"key":"31_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","volume":"6","author":"L.C. Paulson","year":"1998","unstructured":"Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of computer security\u00a06, 85\u2013128 (1998)","journal-title":"Journal of computer security"},{"key":"31_CR13","unstructured":"Ramanujam, R., Suresh, S.P.: A decidable subclass of unbounded security protocols. In: Gorrieri, R. (ed.) Proc. WITS 2003, April 2003, pp. 11\u201320 (2003)"},{"key":"31_CR14","unstructured":"Ramanujam, R., Suresh, S.P.: An equivalence on terms for security protocols. In: Bharadwaj, R. (ed.) Proc. AVIS 2003, April 2003, pp. 45\u201356 (2003)"},{"key":"31_CR15","unstructured":"Ramanujam, R., Suresh, S.P.: Decidability of secrecy for tagged protocols (September 2003), \n                    \n                      http:\/\/www.imsc.res.in\/~jam"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proc. CSFW 14, pp. 174\u2013190 (2001)","DOI":"10.1109\/CSFW.2001.930145"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T09:40:42Z","timestamp":1552815642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}