On the Reachability Problem in Cryptographic Protocols
- 21 December 2000
- book chapter
- Published by Springer Nature
- p. 380-394
- https://doi.org/10.1007/3-540-44618-4_28
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Proving security protocols correctPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A model of computation for the NRL Protocol AnalyzerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Proving properties of security protocols by inductionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The Game of the Name in Cryptographic TablesPublished by Springer Nature ,1999
- Abstracting Cryptographic Protocols with Tree AutomataPublished by Springer Nature ,1999
- Proof techniques for cryptographic processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Using State Space Exploration and a Natural Deduction Style Message Derivation Engine to Verify Security ProtocolsPublished by Springer Nature ,1998
- A calculus for cryptographic protocolsPublished by Association for Computing Machinery (ACM) ,1997
- Security properties and CSPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983