LDYIS: a Framework for Model Checking Security Protocols

We present a formalism for the automatic verification of security protocols based on multi-agent systems semantics. We give the syntax and semantics of a temporal-epistemic securityspecialised logic and provide a lazy-intruder model for the protocol rules that we argue to be particularly suitable for verification purposes. We exemplify the technique by finding a (known) bug in the traditional NSPK protocol.

[1]  Joseph Y. Halpern,et al.  Modeling Adversaries in a Logic for Security Protocol Analysis , 2006, FASec.

[2]  Wojciech Penczek,et al.  Bounded Model Checking for the Universal Fragment of CTL , 2002, Fundam. Informaticae.

[3]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[4]  Wojciech Penczek,et al.  Modelling and Checking Timed Authentication of Security Protocols , 2007, Fundam. Informaticae.

[5]  Ron van der Meyden,et al.  MCK: Model Checking the Logic of Knowledge , 2004, CAV.

[6]  Wojciech Penczek,et al.  Verifying epistemic properties of multi-agent systems via bounded model checking , 2002, AAMAS '03.

[7]  Sebastian Mödersheim,et al.  The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications , 2005, CAV.

[8]  Alessandro Armando,et al.  An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols , 2005, ARSPA@IJCAR.

[9]  Wojciech Penczek,et al.  Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol , 2006, Fundam. Informaticae.

[10]  Wojciech Penczek,et al.  SAT-Based Verification of Security Protocols Via Translation to Networks of Automata , 2007, MoChArt.

[11]  Sebastian Mödersheim,et al.  OFMC: A Symbolic Model-Checker for Security Protocols , 2004 .

[12]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[13]  Wojciech Penczek,et al.  Verics: A Tool for Verifying Timed Automata and Estelle Specifications , 2003, TACAS.

[14]  Kaile Su,et al.  Symbolic model checking the knowledge of the dining cryptographers , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..

[15]  Joseph Y. Halpern.  Revisiting the Foundations of Authentication Logics , 2007 .

[16]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for Multi-agent Systems , 2006, TACAS.

[17]  Alessio Lomuscio,et al.  A complete and decidable security-specialised logic and its application to the TESLA protocol , 2006, AAMAS '06.

[18]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[19]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[20]  Alessio Lomuscio,et al.  Verification of the TESLA protocol in MCMAS-X , 2007, Fundam. Informaticae.