{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:11:59Z","timestamp":1725466319835},"publisher-location":"New York","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387240500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-24098-5_5","type":"book-chapter","created":{"date-parts":[[2005,10,3]],"date-time":"2005-10-03T17:34:04Z","timestamp":1128360844000},"page":"55-70","source":"Crossref","is-referenced-by-count":0,"title":["Pattern-Matching Spi-Calculus"],"prefix":"10.1007","author":[{"given":"Christian","family":"Haack","sequence":"first","affiliation":[]},{"given":"Alan","family":"Jeffrey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"5_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":"5_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-45315-6_2","volume":"2030","author":"M. Abadi","year":"2001","unstructured":"M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. In Foundations of Software Science and Computation Structures, volume 2030 of Lecture Notes in Computer Science, pages 25\u201341. Springer, 2001.","journal-title":"Foundations of Software Science and Computation Structures"},{"key":"5_CR3","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 spi calculus. Information and Computation, 148:1\u201370, 1999.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"C. Bodei, M. Buchholtz, P. Degano, F. Nielson, and H. Riis Nielson. Automatic validation of protocol narration. In Proc. CSFW03, pages 126\u2013140. IEEE Press, 2003.","key":"5_CR4","DOI":"10.1109\/CSFW.2003.1212709"},{"doi-asserted-by":"crossref","unstructured":"D. Bolignano. An approach to the formal verification of cryptographic protocols. In Third ACM Conference on Computer and Communications Security, pages 106\u2013118, 1996.","key":"5_CR5","DOI":"10.1145\/238168.238196"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1098\/rspa.1989.0125","volume":"426","author":"M. Burrows","year":"1989","unstructured":"M. Burrows, M. Abadi, and R.M. Needham. A logic of authentication. Proceedings of the Royal Society of London A, 426:233\u2013271, 1989.","journal-title":"Proceedings of the Royal Society of London A"},{"key":"5_CR7","first-page":"159","volume":"2052","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, volume 2052 of Lecture Notes in Computer Science, pages 159\u2013177. Springer, 2001.","journal-title":"First International Workshop on Mathematical Methods, Models and Architectures for Computer Network Security"},{"doi-asserted-by":"crossref","unstructured":"I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In Proc. IEEE Computer Security Foundations Workshop, pages 55\u201369, 1999.","key":"5_CR8","DOI":"10.1109\/CSFW.1999.779762"},{"doi-asserted-by":"crossref","unstructured":"E. Cohen. TAPS: A first-order verifier for cryptographic protocols. In 13th IEEE Computer Security Foundations Workshop, pages 144\u2013158. IEEE Computer Society Press, 2000.","key":"5_CR9","DOI":"10.1109\/CSFW.2000.856933"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"IT-29","author":"D. Dolev","year":"1983","unstructured":"D. Dolev and A.C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(2): 198\u2013208, 1983.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR11","first-page":"263","volume":"2609","author":"A. D. Gordon","year":"2002","unstructured":"A. D. Gordon and A. S. A. Jeffrey. Typing one-to-one and one-to-many correspondences in security protocols. In Proc. Int. Software Security Symp., volume 2609 of Lecture Notes in Computer Science, pages 263\u2013282. Springer-Verlag, 2002.","journal-title":"Proc. Int. Software Security Symp."},{"doi-asserted-by":"crossref","unstructured":"A.D. Gordon and A. Jeffrey. Authenticity by typing for security protocols. In 14th IEEE Computer Security Foundations Workshop, pages 145\u2013159. IEEE Computer Society Press, 2001.","key":"5_CR12","DOI":"10.1109\/CSFW.2001.930143"},{"doi-asserted-by":"crossref","unstructured":"A.D. Gordon and A. Jeffrey. Types and effects for asymmetric cryptographic protocols. In 15th IEEE Computer Security Foundations Workshop, pages 77\u201391. IEEE Computer Society Press, 2002.","key":"5_CR13","DOI":"10.1109\/CSFW.2002.1021808"},{"unstructured":"C. Haack and A. S. A. Jeffrey. Pattern-matching spi-calculus (longer draft). Available from http:\/\/fpl.cs.depaul.edu\/ajeffrey\/fast04Long.pdf, 2004.","key":"5_CR14"},{"unstructured":"J. Heather. 'Oh!\u2026Is it really you?\u2019 Using rank functions to verify authentication protocols. PhD thesis, Royal Holloway, University of London, 2000.","key":"5_CR15"},{"doi-asserted-by":"crossref","unstructured":"J. Heather and S. Schneider. Towards automatic verification of authentication protocols on an unbounded network. In 13th IEEE Computer Security Foundations Workshop, pages 132\u2013143. IEEE Computer Society Press, 2000.","key":"5_CR16","DOI":"10.1109\/CSFW.2000.856932"},{"key":"5_CR17","first-page":"147","volume":"1055","author":"G. Lowe","year":"1996","unstructured":"G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 147\u2013166. Springer, 1996.","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems"},{"doi-asserted-by":"crossref","unstructured":"W. Marrero, E.M. Clarke, and S. Jha. Model checking for security protocols. In DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997. Preliminary version appears as Technical Report TR-CMU-CS-97-139, Carnegie Mellon University, May 1997.","key":"5_CR18","DOI":"10.21236\/ADA327281"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","volume":"6","author":"L.C. Paulson","year":"1998","unstructured":"L.C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85\u2013128, 1998.","journal-title":"Journal of Computer Security"},{"doi-asserted-by":"crossref","unstructured":"A.W. Roscoe. Modelling and verifying key-exchange protocols using CSP and FDR. In 8th IEEE Computer Security Foundations Workshop, pages 98\u2013107. IEEE Computer Society Press, 1995.","key":"5_CR20","DOI":"10.1109\/CSFW.1995.518556"},{"issue":"9","key":"5_CR21","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/32.713329","volume":"24","author":"S.A. Schneider","year":"1998","unstructured":"S.A. Schneider. Verifying authentication protocols in CSP. IEEE Transactions on Software Engineering, 24(9):741\u2013758, 1998.","journal-title":"IEEE Transactions on Software Engineering"},{"doi-asserted-by":"crossref","unstructured":"F.J. Thayer F\u00e1brega, J.C. Herzog, and J.D. Guttman. Strand spaces: Why is a security protocol correct? In IEEE Computer Society Symposium on Research in Security and Privacy, pages 160\u2013171, 1998.","key":"5_CR22","DOI":"10.21236\/ADA459060"},{"doi-asserted-by":"crossref","unstructured":"T.Y.C. Woo and S.S. Lam. A semantic model for authentication protocols. In IEEE Computer Society Symposium on Research in Security and Privacy, pages 178\u2013194, 1993.","key":"5_CR23","DOI":"10.1109\/RISP.1993.287633"}],"container-title":["IFIP International Federation for Information Processing","Formal Aspects in Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-24098-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:13Z","timestamp":1605643093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-24098-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387240500"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/0-387-24098-5_5","relation":{},"subject":[]}}