A calculus for cryptographic protocols
Information and Computation
Using encryption for authentication in large networks of computers
Communications of the ACM
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Lazy Infinite-State Analysis of Security Protocols
Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Casper: A Compiler for the Analysis of Security Protocols
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Efficient Finite-State Analysis for Large Security Protocols
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
How to Prevent Type Flaw Attacks on Security Protocols
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Brutus: a model checker for security protocols
Brutus: a model checker for security protocols
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A method for symbolic analysis of security protocols
Theoretical Computer Science
Improving the security of industrial networks by means of formal verification
Computer Standards & Interfaces
A Quantifier-free First-order Knowledge Logic of Authentication
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Modelling and Checking Timed Authentication of Security Protocols
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Tools for cryptographic protocols analysis: A technical and experimental comparison
Computer Standards & Interfaces
A Denotational Approach to the Static Analysis of Cryptographic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Is your security protocol on time?
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Modelling and Checking Timed Authentication of Security Protocols
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
A Quantifier-free First-order Knowledge Logic of Authentication
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
| Hi-index | 0.00 |
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 more direct formalization, when compared to finite-state 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.