{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:32:26Z","timestamp":1765485146596},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_31","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T08:39:22Z","timestamp":1196066362000},"page":"376-387","source":"Crossref","is-referenced-by-count":16,"title":["Bounding Messages for Free in Security\u00a0Protocols"],"prefix":"10.1007","author":[{"given":"Myrto","family":"Arapinis","sequence":"first","affiliation":[]},{"given":"Marie","family":"Duflot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Duflot, M.: Bounding messages for free in security protocols (extended version) (2007), \n                    \n                      http:\/\/www.arapinis.org\/publications\/fsttcs07ext.pdf","DOI":"10.1007\/978-3-540-77050-3_31"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Podelski, A.: Verification of cryptographic protocols: Tagging enforces termination. TCS: Theoretical Computer Science\u00a0333 (2005)","DOI":"10.1016\/j.tcs.2004.10.018"},{"key":"31_CR3","unstructured":"Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Research Report LSV-01-13, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France, p. 98 (2001)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"FSTTCS 2007","author":"V. Cortier","year":"2007","unstructured":"Cortier, V., Dela\u00eetre, J., Delaune, S.: Safely composing security protocols. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, Springer, Heidelberg (2007)"},{"key":"31_CR5","unstructured":"Clark, J.A., Jacob, J.L.: A survey of authentication protocol literature (1997)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-45220-1_13","volume-title":"Computer Science Logic","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M., Vigneron, L.: Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 128\u2013141. Springer, Heidelberg (2003)"},{"key":"31_CR7","series-title":"Lecture Notes in Artificial Intelligence","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., Zalinescu, E.: Deciding key cycles for security protocols. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 317\u2013331. Springer, Heidelberg (2006)"},{"key":"31_CR8","unstructured":"Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: Undecidability of bounded security protocols. In: Proc. Work. on Formal Methods and Security Protocols (FMSP) (1999)"},{"issue":"2","key":"31_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.3233\/JCS-2003-11204","volume":"11","author":"J. Heather","year":"2003","unstructured":"Heather, J., Lowe, G., Schneider, S.: How to prevent type flaw attacks on security protocols. Journal of Computer Security\u00a011(2), 217\u2013244 (2003)","journal-title":"Journal of Computer Security"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Lowe, G.: Towards a completeness result for model checking of security protocols. Journal of Computer Security 7(1) (1999)","DOI":"10.3233\/JCS-1999-72-302"},{"key":"31_CR11","unstructured":"Li, Y., Yang, W., Huang, C.-W.: Preventing type flaw attacks on security protocols with a simplified tagging scheme. In: ISICT 2004. Proc. Int. symp. on Information and communication technologies, Trinity College Dublin, pp. 244\u2013249 (2004)"},{"key":"31_CR12","first-page":"166","volume-title":"Proc. 8th ACM Conf. on Computer and Communications Security","author":"J.K. Millen","year":"2001","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proc. 8th ACM Conf. on Computer and Communications Security, pp. 166\u2013175. ACM Press, New York (2001)"},{"key":"31_CR13","unstructured":"Ramanujam, R., Suresh, S.P.: A decidable subclass of unbounded security protocols. In: Proc. Work. on Issues in the Theory of Security (WITS 2003) (2003)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"FST TCS 2003","author":"R. Ramanujam","year":"2003","unstructured":"Ramanujam, R., Suresh, S.P.: Tagging makes secrecy decidable with unbounded nonces as well. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003. LNCS, vol.\u00a02914, Springer, Heidelberg (2003)"},{"key":"31_CR15","first-page":"174","volume-title":"CSFW 2001","author":"M. Rusinowitch","year":"2001","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: CSFW 2001. Proc. 14th IEEE work. on Computer Security Foundations, p. 174. IEEE Computer Society Press, Los Alamitos (2001)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:10:37Z","timestamp":1558278637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}