{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:50Z","timestamp":1761597050780},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_55","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"667-681","source":"Crossref","is-referenced-by-count":57,"title":["Symbolic Trace Analysis of Cryptographic Protocols"],"prefix":"10.1007","author":[{"given":"Michele","family":"Boreale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"1","key":"55_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"M. Abadi, A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1\u201370, 1999.","journal-title":"Information and Computation"},{"issue":"4","key":"55_CR2","first-page":"267","volume":"5","author":"M. Abadi","year":"1998","unstructured":"M. Abadi, A.D. Gordon. A Bisimulation Method for Cryptographic Protocols. Nordic Journal of Computing, 5(4):267\u2013303, 1998.","journal-title":"Nordic Journal of Computing"},{"key":"55_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Asian\u201900","author":"R. Amadio","year":"2000","unstructured":"R. Amadio, S. Prasad. The game of the name in cryptographic tables. RR 3733 INRIA Sophia Antipolis. In Proc. of Asian\u201900, LNCS, 2000."},{"key":"55_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Concur\u201900","author":"R.M. Amadio","year":"2000","unstructured":"R.M. Amadio, S. Lugiez. On the reachability problem in cryptographic protocols. In Proc. of Concur\u201900, LNCS, 2000. Full version: RR 3915 Inria Sophia Antipolis."},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"M. Boreale. Symbolic analysis of cryptographic protocols in the spi-calculus. Manuscript, 2000. Available at http:\/\/www.dsi.unifi.it\/~boreale\/papers.html .","DOI":"10.1007\/3-540-48224-5_55"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"M. Boreale. STA: a tool for trace analysis of cryptographic protocols. ML object code and examples, 2001. Available at http:\/\/www.dsi.unifi.it\/~boreale\/tool.html .","DOI":"10.1007\/3-540-48224-5_55"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"M. Boreale, R. De Nicola, R. Pugliese. Proof Techniques for Cryptographic Processes. In Proc. of LICS\u201999, IEEE Computer Society Press, 1999. Full version to appear in SIAM Journal on Computing.","DOI":"10.1109\/LICS.1999.782608"},{"key":"55_CR8","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, R.M. Needham. A logic of authentication. Proc. of the Royal Society of London, 426:233\u2013271, 1989.","journal-title":"Proc. of the Royal Society of London"},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, S. Jha, W. Marrero. Using state exploration and a natural deduction style message derivation engine to verify security protocols. In Proc. of the IFIP Working Conference on Programming Concepts and Methods (PROCOMET), 1998.","DOI":"10.1007\/978-0-387-35358-6_10"},{"key":"55_CR10","unstructured":"N. Durgin, P. Lincoln, J. Mitchell, A. Scedrov. Undecidability of bounded security protocols. In Proc. of Workshop on Formal Methods and Security Protocols, Trento, 1999."},{"issue":"2","key":"55_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"D. Dolev, A.C. Yao. On the security of public key protocols. In IEEE Transactions on Information Theory 29(2):198\u2013208, 1983.","journal-title":"IEEE Transactions on Information Theory"},{"key":"55_CR12","unstructured":"A. Huima. Efficient infinite-state analysis of security protocols. In Proc. of Workshop on Formal Methods and Security Protocols, Trento, 1999."},{"key":"55_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Proceedings of TACAS\u201996","author":"G. Lowe","year":"1996","unstructured":"G. Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In Proceedings of TACAS\u201996, (T. Margaria, B. Steffen, Eds.), LNCS 1055, pp. 147\u2013166, Springer-Verlag, 1996."},{"key":"55_CR14","doi-asserted-by":"crossref","unstructured":"G. Lowe. A Hierarchy of Authentication Specifications. In 10th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 1997.","DOI":"10.1109\/CSFW.1997.596782"},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"G. Lowe. Towards a completeness result for model checking of security protocols. In 11th Computer Security Foundations Workshop, IEEE Computer Society Press, 1998.","DOI":"10.1109\/CSFW.1998.683159"},{"key":"55_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-49059-0_11","volume-title":"Proc. of TACAS99","author":"D. Marchignoli","year":"1999","unstructured":"D. Marchignoli, F. Martinelli. Automatic verification of cryptographic protocols through compositional analysis techniques. In Proc. of TACAS99, LNCS 1579:148\u2013163, 1999."},{"key":"55_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, D. Walker. A calculus of mobile processes, (Part I and II). Information and Computation, 100:1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"55_CR18","doi-asserted-by":"crossref","unstructured":"L.C. Paulson. Proving Security Protocols Correct. In Proc. of LICS\u201999, IEEE Computer Society Press, 1999.","DOI":"10.1109\/LICS.1999.782632"},{"key":"55_CR19","doi-asserted-by":"crossref","unstructured":"A.W. Roscoe. Modelling and verifying key-exchange using CSP and FDR. In 8th Computer Security Foundations Workshop, IEEE Computer Society Press, 1995.","DOI":"10.1109\/CSFW.1995.518556"},{"key":"55_CR20","unstructured":"A.W. Roscoe. Proving security protocols with model checkers by data independent techniques. In 11th Computer Security Foundations Workshop, IEEE Computer Society Press, 1998."},{"issue":"8","key":"55_CR21","first-page":"743","volume":"24","author":"S. Schneider","year":"1998","unstructured":"S. Schneider. Verifying Authentication Protocols in CSP. IEEE Transactions on Software Engineering, 24(8):743\u2013758, 1998.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"55_CR22","unstructured":"S. Stoller. A reduction for automated verification of security protocols. In Proc. Of Workshop on Formal Methods and Security Protocols, Trento, 1999."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:06Z","timestamp":1556936886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_55","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}