Automatic Verification of Cryptographic Protocols through Compositional Analysis Techniques
- 12 March 1999
- book chapter
- Published by Springer Nature
- p. 148-162
- https://doi.org/10.1007/3-540-49059-0_11
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Partial model checking and theorem proving for ensuring security propertiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient finite-state analysis for large security protocolsPublished 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
- A probabilistic poly-time framework for protocol analysisPublished by Association for Computing Machinery (ACM) ,1998
- Using CSP to detect errors in the TMN protocolIEEE Transactions on Software Engineering, 1997
- Reasoning about cryptographic protocols in the spi calculusPublished by Springer Nature ,1997
- The Compositional Security Checker: a tool for the verification of information flow security propertiesIEEE Transactions on Software Engineering, 1997
- Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDRPublished by Springer Nature ,1996
- A Classification of Security Properties for Process Algebras1Journal of Computer Security, 1995
- Compositionality Through an Operational Semantics of ContextsJournal of Logic and Computation, 1991