{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:45:25Z","timestamp":1765485925787,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319241760"},{"type":"electronic","value":"9783319241777"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24177-7_11","type":"book-chapter","created":{"date-parts":[[2015,10,9]],"date-time":"2015-10-09T14:47:11Z","timestamp":1444402031000},"page":"209-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Typing and Compositionality for Security Protocols: A Generalization to the Geometric Fragment"],"prefix":"10.1007","author":[{"given":"Omar","family":"Almousa","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"M\u00f6dersheim","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Modesti","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Vigan\u00f2","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,18]]},"reference":[{"key":"11_CR1","unstructured":"Almousa, O., M\u00f6dersheim, S., Modesti, P., Vigan\u00f2, L.: Typing and compositionality for security protocols: a generalization to the geometric fragment (extended version). DTU Compute Technical report-2015-03 (2015). http:\/\/www.imm.dtu.dk\/~samo\/"},{"issue":"2\u20134","key":"11_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.ic.2007.07.002","volume":"206","author":"S Andova","year":"2008","unstructured":"Andova, S., Cremers, C.J.F., Gj\u00f8steen, K., Mauw, S., Mj\u00f8lsnes, S.F., Radomirovic, S.: A framework for compositional verification of security protocols. Inf. Comput. 206(2\u20134), 425\u2013459 (2008)","journal-title":"Inf. Comput."},{"key":"11_CR3","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. 4855, pp. 376\u2013387. Springer, Heidelberg (2007)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ic.2014.09.003","volume":"239","author":"M Arapinis","year":"2014","unstructured":"Arapinis, M., Duflot, M.: Bounding messages for free in security protocols - extension to various security properties. Inf. Comput. 239, 182\u2013215 (2014)","journal-title":"Inf. Comput."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1007\/978-3-540-30227-8_68","volume-title":"Logics in Artificial Intelligence","author":"A Armando","year":"2004","unstructured":"Armando, A., Compagna, L.: SATMC: a sat-based model checker for security protocols. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 730\u2013733. Springer, Heidelberg (2004)"},{"issue":"1\u20132","key":"11_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2004.10.018","volume":"333","author":"B Blanchet","year":"2005","unstructured":"Blanchet, B., Podelski, A.: Verification of cryptographic protocols: tagging enforces termination. Theor. Comput. Sci. 333(1\u20132), 67\u201390 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Delaune, S., Millen, J.K.: Constraint solving techniques and enriching the model with equational theories. In: Formal Models and Techniques for Analyzing Security Protocols, pp. 35\u201361. IOS Press (2011)","DOI":"10.3233\/978-1-60750-714-7-35"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-008-0059-4","volume":"34","author":"V Cortier","year":"2009","unstructured":"Cortier, V., Delaune, S.: Safely composing security protocols. Form. Methods Syst. Des. 34, 1\u201336 (2009)","journal-title":"Form. Methods Syst. Des."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Ciob\u00e2c\u0103, \u015e., Cortier, V.: Protocol composition for arbitrary primitives. In: CSF, pp. 322\u2013336. IEEE (2010)","DOI":"10.1109\/CSF.2010.29"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-00596-1_22","volume-title":"Foundations of Software Science and Computational Structures","author":"JD Guttman","year":"2009","unstructured":"Guttman, J.D.: Cryptographic protocol composition via the authentication tests. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 303\u2013317. Springer, Heidelberg (2009)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.3233\/JCS-140499","volume":"22","author":"JD Guttman","year":"2014","unstructured":"Guttman, J.D.: Establishing and preserving protocol security goals. J. Comput. Secur. 22(2), 203\u2013267 (2014)","journal-title":"J. Comput. Secur."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Guttman, J.D., Thayer, F.J.: Protocol independence through disjoint encryption. In: CSFW, pp. 24\u201334. IEEE (2000)","DOI":"10.1109\/CSFW.2000.856923"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","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. J. Comput. Secur. 11(2), 217\u2013244 (2003)","journal-title":"J. Comput. Secur."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T.: Using ProVerif to analyze protocols with Diffie-Hellman exponentiation. In: CSF, pp. 157\u2013171. IEEE (2009)","DOI":"10.1109\/CSF.2009.17"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Lowe, G.: A hierarchy of authentication specifications. In: CSFW, pp. 31\u201344 (1997)","DOI":"10.1109\/CSFW.1997.596782"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: CCS, pp. 166\u2013175. ACM (2001)","DOI":"10.1145\/501983.502007"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-29420-4_14","volume-title":"Formal Aspects of Security and Trust","author":"S M\u00f6dersheim","year":"2012","unstructured":"M\u00f6dersheim, S.: Diffie-Hellman without difficulty. In: Barthe, G., Datta, A., Etalle, S. (eds.) FAST 2011. LNCS, vol. 7140, pp. 214\u2013229. Springer, Heidelberg (2012)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-33167-1_8","volume-title":"Computer Security \u2013 ESORICS 2012","author":"S M\u00f6dersheim","year":"2012","unstructured":"M\u00f6dersheim, S.: Deciding security for a fragment of ASLan. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 127\u2013144. Springer, Heidelberg (2012)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"M\u00f6dersheim, S., Katsoris, G.: A sound abstraction of the parsing problem. In: CSF, pp. 259\u2013273. IEEE (2014)","DOI":"10.1109\/CSF.2014.26"},{"issue":"1\u20133","key":"11_CR20","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 a finite number of sessions and composed keys is NP-complete. Theor. Comput. Sci. 299(1\u20133), 451\u2013475 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3233\/JCS-1999-72-304","volume":"7","author":"FJ Thayer","year":"1999","unstructured":"Thayer, F.J., Herzog, J.C., Guttman, J.D.: Strand spaces: proving security protocols correct. J. Comput. Secur. 7(1), 191\u2013230 (1999)","journal-title":"J. Comput. Secur."}],"container-title":["Lecture Notes in Computer Science","Computer Security -- ESORICS 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24177-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:03:41Z","timestamp":1748649821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24177-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319241760","9783319241777"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24177-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}