Computing symbolic models for verifying cryptographic protocols

Proceedings of the Computer Security Foundations Workshop

Volumn , Issue , 2001, Pages 160-173

  Fiore, M ^a   Abadi, M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; DATA FLOW ANALYSIS; DECODING; ENCODING (SYMBOLS); MATHEMATICAL MODELS; SECURITY OF DATA;

CRYPTOGRAPHIC PROTOCOLS;

NETWORK PROTOCOLS;

EID: 0034829105     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Security protocols and their properties
2. A calculus for cryptographic protocols: The spi calculus
3. On the reachability problem in cryptographic protocols
4. Symbolic trace analysis of cryptographic protocols
5. Using state space exploration and a natural deduction style message derivation engine to verify security protocols
6. On the security of public key protocols
7. Communicating sequential processes
8. Efficient infinite-state analysis of security protocols
9. Fast, automatic checking of security protocols
10. Breaking and fixing the Needham-Schroeder public-key protocol using FDR
11. Formal verification of cryptographic protocols: A survey
12. The NRL protocol analyzer: An overview
13. The Interrogator: Protocol security analysis
14. A calculus of mobile processes, I and II
15. Finite-state analysis of security protocols
16. Automated analysis of cryptographic protocols using Murφ
17. The inductive approach to verifying cryptographic protocols
18. Security properties and CSP
19. Efficient finite-state analysis for large security protocols
20. Athena: A new efficient automatic checker for security protocol analysis
21. Towards an automatic analysis of security protocols in first-order logic
22. A semantic model for authentication protocols