{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:15:26Z","timestamp":1778249726279,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440437","type":"print"},{"value":"9783540456940","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45694-5_7","type":"book-chapter","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T03:44:18Z","timestamp":1191555858000},"page":"99-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Types for Cryptographic Protocols"],"prefix":"10.1007","author":[{"given":"Andrew D.","family":"Gordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/324133.324266","volume":"46","author":"M. Abadi","year":"1999","unstructured":"M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749\u2013786, September 1999.","journal-title":"Journal of the ACM"},{"key":"7_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-45315-6_2","volume-title":"Foundations of Software Science and Computation Structures (FoSSaCS 2001)","author":"M. Abadi","year":"2001","unstructured":"M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. In Foundations of Software Science and Computation Structures (FoSSaCS 2001), volume 2030 of Lecture Notes in Computer Science, pages 25\u201341. Springer, 2001."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"M. Abadi and B. Blanchet. Analyzing security protocols with secrecy types and logic programs. In 29th ACM Symposium on Principles of Programming Languages (POPL\u201902), pages 33\u201344, 2002.","DOI":"10.1145\/503272.503277"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"M. Abadi, C. Fournet, and G. Gonthier. Secure communications implementation of channel abstractions. In 13th IEEE Symposium on Logic in Computer Science (LICS\u201998), pages 105\u2013116, 1998.","DOI":"10.1109\/LICS.1998.705647"},{"key":"7_CR5","first-page":"267","volume":"5","author":"M. Abadi","year":"1998","unstructured":"M. Abadi and A. D. Gordon. A bisimulation method for cryptographic protocols. Nordic Journal of Computing, 5:267\u2013303, 1998.","journal-title":"Nordic Journal of Computing"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spicalculus. Information and Computation, 148:1\u201370, 1999.","journal-title":"Information and Computation"},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-46674-6_3","volume-title":"Advances in Computing Science (ASIAN\u201999)","author":"R. Amadio","year":"1999","unstructured":"R. Amadio and S. Prasad. The game of the name in cryptographic tables. In Advances in Computing Science (ASIAN\u201999), volume 1742 of Lecture Notes in Computer Science, pages 5\u201326. Springer, 1999."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"M. Boreale, R. De Nicola, and R. Pugliese. Proof techniques for cryptographic processes. In 14th IEEE Symposium on Logic in Computer Science, pages 157\u2013166, 1999.","DOI":"10.1109\/LICS.1999.782608"},{"key":"7_CR9","series-title":"Lect Notes Comput Sci","volume-title":"On bisimulations for the spi calculus","author":"B. Borgstr\u00f6m","year":"2002","unstructured":"B. Borgstr\u00f6m and U. Nestmann. On bisimulations for the spi calculus. In International Conference on Algebraic Methodology And Software Technology (AMAST2002), Lecture Notes in Computer Science. Springer, 2002. To appear."},{"key":"7_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-45116-1_18","volume-title":"Typed MSR: Syntax and examples","author":"I. Cervesato","year":"2001","unstructured":"I. Cervesato. Typed MSR: Syntax and examples. In First International Workshop on Mathematical Methods, Models and Architectures for Computer Network Security (MMM\u201901), volume 2052 of Lecture Notes in Computer Science, pages 159\u2013177. Springer, 2001."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"M. Dam. Proving trust in systems of second-order processes. In 31st Hawaii International Conference on System Sciences, volume VII, pages 255\u2013264, 1998.","DOI":"10.1109\/HICSS.1998.649220"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"N. Durgin, J. C. Mitchell, and D. Pavlovic. A compositional logic for protocol correctness. In 14th IEEE Computer Security Foundations Workshop, pages 241\u2013255. IEEE Computer Society Press, 2001.","DOI":"10.1109\/CSFW.2001.930150"},{"issue":"3","key":"7_CR13","first-page":"175","volume":"21","author":"A. S. Elkj\u00e6r","year":"1999","unstructured":"A. S. Elkj\u00e6r, M. H\u00f6hle, H. H\u00fcttel, and K. Overg\u00e5rd. Towards automatic bisimilarity checking in the spi calculus. Australian Computer Science Communications, 21(3):175\u2013189, 1999.","journal-title":"Australian Computer Science Communications"},{"issue":"1","key":"7_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","volume":"3","author":"R. Focardi","year":"1994","unstructured":"R. Focardi and R. Gorrieri. A classication of security properties for process algebra. Journal of Computer Security, 3(1):5\u201333, 1994.","journal-title":"Journal of Computer Security"},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/3-540-45499-3_20","volume-title":"Message authentication through noninterference","author":"R. Focardi","year":"2000","unstructured":"R. Focardi, R. Gorrieri, and F. Martinelli. Message authentication through noninterference. In International Conference on Algebraic Methodology And Software Technology (AMAST2000), volume 1816 of Lecture Notes in Computer Science, pages 258\u2013272. Springer, 2000."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"A. D. Gordon and A. Jerey. Authenticity by typing for security protocols. In 14th IEEE Computer Security Foundations Workshop, pages 145\u2013159. IEEE Computer Society Press, 2001.","DOI":"10.1109\/CSFW.2001.930143"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"A. D. Gordon and A. Jerey. Typing correspondence assertions for communication protocols. In Mathematical Foundations of Programming Semantics 17, volume 45 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001. Pages 99\u2013120 of the Preliminary Proceedings, BRICS Notes Series NS-01-2, BRICS, University of Aarhus, May 2001. Extended version to appear in Theoretical Computer Science.","DOI":"10.1016\/S1571-0661(04)80959-9"},{"key":"7_CR18","unstructured":"A. D. Gordon and A. Jerey. Types and eects for asymmetric cryptographic protocols. In 15th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, 2002. To appear."},{"key":"7_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201996)","author":"G. Lowe","year":"1996","unstructured":"G. Lowe. Breaking and xing the Needham-Schroeder public-key protocol using CSP and FDR. In T. Margaria and B. Steen, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201996), volume 1055 of Lecture Notes in Computer Science, pages 147\u2013166. Springer, 1996."},{"key":"7_CR20","unstructured":"P. Ryan and S. Schneider. Modelling and Analysis of Security Protocols. Addison-Wesley, 2001."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2002 \u2014 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45694-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:45:57Z","timestamp":1778247957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45694-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440437","9783540456940"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45694-5_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}