SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
- Cite this paper as:
- Kurkowski M., Penczek W., Zbrzezny A. (2007) SAT-Based Verification of Security Protocols Via Translation to Networks of Automata. In: Edelkamp S., Lomuscio A. (eds) Model Checking and Artificial Intelligence. MoChArt 2006. Lecture Notes in Computer Science, vol 4428. Springer, Berlin, Heidelberg
In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model checking. These automata correspond to executions of the participants as well as to their knowledge about letters. Given a bounded number of sessions, we can verify both correctness or incorrectness of a security protocol proving either reachability or unreachability of an undesired state. We exemplify all our notions on the Needham Schroeder Public Key Authentication Protocol (NSPK) and show experimental results for checking authentication using the verification tool VerICS.
Keywordssecurity protocols model checking authentication
Unable to display preview. Download preview PDF.