On the Reachability Problem in Cryptographic Protocols
Authors:
- 21 December 2000
- book chapter
- Published by Springer Nature
- p. 380-394
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A model of computation for the NRL Protocol Analyzer2002
- Proving properties of security protocols by induction2002
- The Game of the Name in Cryptographic TablesLecture Notes in Computer Science, 1999
- Abstracting Cryptographic Protocols with Tree Automata1999
- Proof techniques for cryptographic processes1999
- Using State Space Exploration and a Natural Deduction Style Message Derivation Engine to Verify Security Protocols1998
- A calculus for cryptographic protocols1997
- Security properties and CSP1996
- An approach to the formal verification of cryptographic protocols1996
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983