SAT-Based Verification of Security Protocols Via Translation to Networks of Automata

  • Mirosław Kurkowski
  • Wojciech Penczek
  • Andrzej Zbrzezny
Conference paper

DOI: 10.1007/978-3-540-74128-2_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4428)
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

Abstract

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.

Keywords

security protocols model checking authentication 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Mirosław Kurkowski
    • 1
  • Wojciech Penczek
    • 2
    • 3
  • Andrzej Zbrzezny
    • 1
  1. 1.Institute of Mathematics and Computer Science, Jan Długosz University, Armii Krajowej 13/15, 42-200 Czȩstochowa 
  2. 2.Institute of Computer Science, PAS, Ordona 21, 01-237 WarsawPoland
  3. 3.Institute of Informatics, Podlasie Academy, Sienkiewicza 51, 08-110 SiedlcePoland

Personalised recommendations