eprintid: 133 rev_number: 10 eprint_status: archive userid: 29 dir: disk0/00/00/01/33 datestamp: 2011-03-01 10:58:52 lastmod: 2011-07-11 14:33:43 status_changed: 2011-03-01 10:58:52 type: book_section metadata_visibility: show item_issues_count: 0 creators_name: Boreale, Michele creators_name: Buscemi, Maria Grazia creators_id: creators_id: m.buscemi@imtlucca.it title: Experimenting with STA, a Tool for Automatic Analysis of Security Protocols ispublished: pub subjects: QA75 subjects: QA76 divisions: CSA full_text_status: none note: Primary Classification: C. Computer Systems Organization C.2 COMPUTER-COMMUNICATION NETWORKS C.2.2 Network Protocols Subjects: Protocol verification Additional Classification: D. Software D.4 OPERATING SYSTEMS D.4.6 Security and Protection abstract: We present STA (Symbolic Trace Analyzer). a tool for the analysis of security protocols. STA relies on symbolic techniques that avoid explicit construction of the whole, possibly infinite, state-space of protocols. This results in accurate protocol modeling, increased efficiency and mere direct formalization, when compared to finitestate techniques. We illustrate the use of STA by analyzing the well-known asymmetric Needham Schroeder protocol. We discuss the results of this analysis, and contrast them with previous work based on finite-state model checking. date: 2002 date_type: published publisher: ACM Press place_of_pub: Madrid pagerange: 281-285 id_number: 10.1145/508791.508847 refereed: TRUE isbn: 1-58113-445-2 book_title: Proceedings of ACM Symposium in Applied Computing (SAC ’02) official_url: http://dx.doi.org/10.1145/508791.508847 funders: Research partly supported by the Italian MURST Project TOSCA (Teoria della Concorrenza, Linguaggi di Online Superiore e Strutture di Tipi). citation: Boreale, Michele and Buscemi, Maria Grazia Experimenting with STA, a Tool for Automatic Analysis of Security Protocols. In: Proceedings of ACM Symposium in Applied Computing (SAC ’02). ACM Press, Madrid, pp. 281-285. ISBN 1-58113-445-2 (2002)