{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:32Z","timestamp":1759638812354},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643029"},{"type":"electronic","value":"9783540697220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053560","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:40:18Z","timestamp":1149658818000},"page":"12-26","source":"Crossref","is-referenced-by-count":13,"title":["A bisimulation method for cryptographic protocols"],"prefix":"10.1007","author":[{"given":"Martin","family":"Abadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew D.","family":"Gordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi. Secrecy by typing in security protocols. In Theoretical Aspects of Computer Software, volume 1281 of Lecture Notes in Computer Science, pages 611\u2013638. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0014571"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, pages 36\u201347, 1997.","DOI":"10.1145\/266420.266432"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Technical Report 414, University of Cambridge Computer Laboratory, January 1997.","DOI":"10.1145\/266420.266432"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"M. Abadi and A. D. Gordon. Reasoning about cryptographic protocols in the spi calculus. In CONCUR'97: Concurrency Theory, volume 1243 of Lecture Notes in Computer Science, pages 59\u201373. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63141-0_5"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"D. Bolignano. An approach to the formal verification of cryptographic protocols. In 3rd ACM Conference on Computer and Communications Security, pages 106\u2013118, March 1996.","DOI":"10.1145\/238168.238196"},{"key":"2_CR6","unstructured":"Data encryption standard. Fed. Inform. Processing Standards Pub. 46, National Bureau of Standards, Washington DC, January 1977."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"R. Focardi and R. Gorrieri. A classification of security properties. Journal of Computer Security, 3(1), 1995.","DOI":"10.3233\/JCS-1994\/1995-3103"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"J. Gray and J. McLean. Using temporal logic to specify and verify cryptographic protocols (progress report). In Proceedings of the 8th IEEE Computer Security Foundations Workshop, pages 108\u2013116, 1995.","DOI":"10.1109\/CSFW.1995.518557"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"R. A. Kemmerer. Analyzing encryption protocols using formal verification techniques. IEEE Journal on Selected Areas in Communications, 7, 1989.","DOI":"10.1109\/49.17707"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 147\u2013166. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61042-1_43"},{"issue":"2","key":"2_CR11","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1109\/TSE.1987.233151","volume":"SE-13","author":"J. K. Millen","year":"1987","unstructured":"J. K. Millen, S. C. Clark, and S. B. Freedman. The Interrogator: Protocol security analysis. IEEE Transactions on Software Engineering, SE-13(2):274\u2013288, February 1987.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"2_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1992-1102","volume":"1","author":"C. Meadows","year":"1992","unstructured":"C. Meadows. Applying formal methods to the analysis of a key management protocol. Journal of Computer Security, 1(1):5\u201336, 1992.","journal-title":"Journal of Computer Security"},{"key":"2_CR13","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, 1989."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"J. K. Millen. The Interrogator model. In IEEE Symposium on Security and Privacy, pages 251\u2013260, 1995.","DOI":"10.1109\/SECPRI.1995.398937"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Information and Computation, pages 1\u201340 and 41\u201377, September 1992.","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science: 5th GI-Conference, Karlsruhe, volume 104 of Lecture Notes in Computer Science, pages 167\u2013183. Springer-Verlag, March 1981.","DOI":"10.1007\/BFb0017309"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"L. Paulson. Proving properties of security protocols by induction. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 70\u201383, 1997.","DOI":"10.1109\/CSFW.1997.596788"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In Mathematical Foundations of Computer Science, Proc. 18th Int. Symp., Gdansk, 1993, volume 711 of Lecture Notes in Computer Science, pages 122\u2013141. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57182-5_8"},{"issue":"5","key":"2_CR19","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B. Pierce","year":"1996","unstructured":"B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409\u2013453, October 1996.","journal-title":"Mathematical Structures in Computer Science"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"S. Schneider. Security properties and CSP. In IEEE Symposium on Security and Privacy, pages 174\u2013187, 1996.","DOI":"10.1109\/SECPRI.1996.502680"},{"key":"2_CR21","unstructured":"B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc., second edition, 1996."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T09:15:02Z","timestamp":1586942102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643029","9783540697220"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0053560","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}