Experimenting with STA, a tool for automatic analysis of security protocols

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2002, Pages 281-285

  Boreale, Michele ^a   Buscemi, Maria Grazia ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); FINITE AUTOMATA; REQUIREMENTS ENGINEERING; SECURITY OF DATA; TIME SHARING PROGRAMS;

FINITE STATE MODEL; NEEDHAM SCHROEDER PROTOCOL; SECURITY PROTOCOLS; SYMBOLIC TRACE ANALYZER;

NETWORK PROTOCOLS;

EID: 0036037230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/508791.508847     Document Type: Conference Paper

References (20)

1. A calculus for cryptographic protocols: The spi calculus
2. On the reachability problem in cryptographic protocols
3. STA: A tool for trace analysis of cryptographic protocols. ML object code and examples
4. Symbolic trace analysis of cryptographic protocols
5. A framework for the analysis of security protocols
6. Analyzing a library of security protocols using casper and FDR
7. On the security of public-key protocols
8. Undecidability of bounded security protocols
9. Computing symbolic models for verifying cryptographic protocols
10. Efficient infinite-state analysis of security protocols
11. How to prevent type flaw attacks on security protocols
12. The Kerberos network authentication service (version 5)
13. Casper, a compiler for the analysis of security protocols
14. Breaking and fixing the needham-schroeder public-key protocol using FDR
15. A hierarchy of authentication specifications
16. Model checking for security protocols
17. Automated analysis of cryptographic protocols using mur@@@
18. Using encryption for authentication in large networks of computers
19. Protocol insecurity with finite number of sessions in NP-complete
20. Efficient finite-state analysis for large security protocols