{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:07:23Z","timestamp":1725894443926},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642368295"},{"type":"electronic","value":"9783642368301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36830-1_8","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T14:35:47Z","timestamp":1361198147000},"page":"147-166","source":"Crossref","is-referenced-by-count":2,"title":["Lazy Mobile Intruders"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"M\u00f6dersheim","sequence":"first","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: ACM Symposium on Principles of Programming Languages, pp. 104\u2013115 (2001)","DOI":"10.1145\/373243.360213"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.tcs.2003.12.023","volume":"322","author":"M. Abadi","year":"2004","unstructured":"Abadi, M., Fournet, C.: Private Authentication. Theoretical Computer Science\u00a0322(3), 427\u2013476 (2004)","journal-title":"Theoretical Computer Science"},{"key":"8_CR3","unstructured":"Algesheimer, J., Cachin, C., Camenisch, J., Karjoth, G.: Cryptographic security for mobile code. In: IEEE Symposium on Security and Privacy, pp. 2\u201311 (2001)"},{"key":"8_CR4","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\u00a0Protocols. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 376\u2013387. Springer, Heidelberg (2007)"},{"key":"8_CR5","unstructured":"Avanesov, T., Chevalier, Y., Rusinowitch, M., Turuani, M.: Intruder deducibility constraints with negation. CoRR, abs\/1207.4871 (2012)"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10207-004-0055-7","volume":"4","author":"D. Basin","year":"2005","unstructured":"Basin, D., M\u00f6dersheim, S., Vigan\u00f2, L.: OFMC: A symbolic model checker for security protocols. International Journal of Information Security\u00a04(3), 181\u2013208 (2005)","journal-title":"International Journal of Information Security"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/963778.963781","volume":"26","author":"M. Bugliesi","year":"2004","unstructured":"Bugliesi, M., Castagna, G., Crafa, S.: Access control for mobile agents: The calculus of boxed ambients. ACM Trans. Program. Lang. Syst.\u00a026(1), 57\u2013124 (2004)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci.\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-24597-1_11","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 124\u2013135. Springer, Heidelberg (2003)"},{"issue":"2-4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.ic.2007.07.005","volume":"206","author":"S. Delaune","year":"2008","unstructured":"Delaune, S., Lafourcade, P., Lugiez, D., Treinen, R.: Symbolic protocol analysis for monoidal equational theories. Inf. Comput.\u00a0206(2-4), 312\u2013351 (2008)","journal-title":"Inf. Comput."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11555827_28","volume-title":"Computer Security \u2013 ESORICS 2005","author":"T. Gro\u00df","year":"2005","unstructured":"Gro\u00df, T., Pfitzmann, B., Sadeghi, A.-R.: Browser Model for Security Analysis of Browser-Based Protocols. In: De Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 489\u2013508. Springer, Heidelberg (2005)"},{"key":"8_CR12","unstructured":"Huima, A.: Efficient infinite-state analysis of security protocols. In: Proc. FLOC 1999 Workshop on Formal Methods and Security Protocols (1999)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proceedings of CCS 2001, pp. 166\u2013175. ACM Press (2001)","DOI":"10.1145\/502006.502007"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"M\u00f6dersheim, S., Nielson, F., Nielson, H.R.: Lazy mobile intruders (extended version). Technical Report IMM-TR-2012-13, DTU Informatics (2012), \n \n imm.dtu.dk\/~samo","DOI":"10.1007\/978-3-642-36830-1_8"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In: POPL, pp. 106\u2013119 (1997)","DOI":"10.1145\/263699.263712"},{"issue":"299","key":"8_CR16","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"1","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theor. Comput. Sci.\u00a01(299), 451\u2013475 (2003)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36830-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T04:14:59Z","timestamp":1557548099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36830-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642368295","9783642368301"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36830-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}