Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions

Electronic Notes in Theoretical Computer Science

Volumn 173, Issue SPEC. ISS., 2007, Pages 85-102

  Doghmi, Shaddin F ^a   Guttman, Joshua D ^b   Thayer, F Javier ^b  

^a STANFORD UNIVERSITY   (United States)

^b MITRE CORPORATION   (United States)

Author keywords

enumerating protocol executions; mechanizing protocol analysis; protocol analysis; strand spaces

Indexed keywords

CRYPTOGRAPHY; INFORMATION ANALYSIS;

CRYPTOGRAPHIC PROTOCOLS; ENUMERATING PROTOCOL EXECUTIONS; STRAND SPACES;

NETWORK PROTOCOLS;

EID: 33847679489     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.029     Document Type: Article

References (9)

1. Blanchet B., and Podelski A. Verification of cryptographic protocols: Tagging enforces termination. In: Gordon A.D. (Ed). Foundations of Software Science and Computation Structures. LNCS number 2620 (April 2003), Springer 136-152
2. Doghmi S.F., Guttman J.D., and Javier Thayer F. Searching for shapes in cryptographic protocols. Tools and Algorithms for Construction and Analysis of Systems (TACAS). LNCS (March 2007), Springer. http://eprint.iacr.org/2006/435 Extended version at URL
3. Guttman J.D. Security goals: Packet trajectories and strand spaces. In: Gorrieri R., and Focardi R. (Eds). Foundations of Security Analysis and Design. LNCS volume 2171 (2001), Springer Verlag 197-261
4. Guttman J.D., and Javier Thayer F. Authentication tests and the structure of bundles. Theoretical Computer Science 283 2 (June 2002) 333-380
5. Guttman J.D., Javier Thayer F., and Zuck L.D. The faithfulness of abstract protocol analysis: Message authentication. Journal of Computer Security 12 6 (2004) 865-891
6. Lowe G. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Proceeedings of tacas. Lecture Notes in Computer Science volume 1055 (1996), Springer Verlag 147-166
7. Needham R., and Schroeder M. Using encryption for authentication in large networks of computers. Communications of the ACM 21 12 (1978)
8. R. Ramanujam and S.P. Suresh. A decidable subclass of unbounded security protocol. In R. Gorrieri, editor, WITS '03: Workshop on Issues in the Theory of Security, pages 11-20, Warsaw, April 2003
9. Dawn Xiaodong Song. Athena: a new efficient automated checker for security protocol analysis. Proceedings of the 12th IEEE Computer Security Foundations Workshop (June 1999), IEEE Computer Society Press