Verification of cryptographic protocols: tagging enforces termination
- 1 March 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 333 (1-2) , 67-90
- https://doi.org/10.1016/j.tcs.2004.10.018
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- An efficient cryptographic protocol verifier based on prolog rulesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Capturing parallel attacks within the data independence frameworkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- TAPS: a first-order verifier for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On Name Generation and Set-Based Analysis in the Dolev-Yao ModelPublished by Springer Nature ,2002
- A Framework for the Analysis of Security Protocols*Published by Springer Nature ,2002
- From Secrecy to Authenticity in Security ProtocolsPublished by Springer Nature ,2002
- Analyzing security protocols with secrecy types and logic programsPublished by Association for Computing Machinery (ACM) ,2002
- Tree Automata with One Memory, Set Constraints, and Ping-Pong ProtocolsPublished by Springer Nature ,2001
- Prudent engineering practice for cryptographic protocolsIEEE Transactions on Software Engineering, 1996
- A logic of authenticationProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1989