A tool for lazy verification of security protocols
- 25 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We present the lazy strategy implemented in a compiler of cryptographic protocols, Casrul. The purpose of this compiler is to verify protocols and to translate them into rewrite rules that can be used by several kinds of automatic or semi-automatic tools for finding flaws, or proving properties. It is entirely automatic, and the efficiency of the generated rules is guaranteed because of the use of a lazy model of intruder behavior. This efficiency is illustrated on several examples.Keywords
This publication has 6 references indexed in Scilit:
- Towards the formal verification of electronic commerce protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Compiling and Verifying Security ProtocolsPublished by Springer Nature ,2002
- A compiler for analyzing cryptographic protocols using noninterferenceACM Transactions on Software Engineering and Methodology, 2000
- Lazy Infinite-State Analysis of Security ProtocolsPublished by Springer Nature ,1999
- Automated deduction with associative-commutative operatorsApplicable Algebra in Engineering, Communication and Computing, 1995
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983