Verification of Cryptographic Protocols: Tagging Enforces Termination
- 28 February 2003
- book chapter
- Published by Springer Nature
- p. 136-152
- https://doi.org/10.1007/3-540-36576-1_9
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On Name Generation and Set-Based Analysis in the Dolev-Yao ModelPublished by Springer Nature ,2002
- From Secrecy to Authenticity in Security ProtocolsPublished by Springer Nature ,2002
- An Improved Constraint-Based System for the Verification of Security ProtocolsPublished by Springer Nature ,2002
- Tree Automata with One Memory, Set Constraints, and Ping-Pong ProtocolsPublished by Springer Nature ,2001
- Control-Flow Analysis in Cubic TimePublished by Springer Nature ,2001
- A Method for Automatic Cryptographic Protocol VerificationPublished by Springer Nature ,2000
- Automating Data IndependencePublished by Springer Nature ,2000
- Towards an Automatic Analysis of Security Protocols in First-Order LogicPublished by Springer Nature ,1999
- Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDRPublished by Springer Nature ,1996
- Prudent engineering practice for cryptographic protocolsIEEE Transactions on Software Engineering, 1996