Using Backward Induction Techniques in (Timed) Security Protocols Verification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Using Backward Induction Techniques in (Timed) Security Protocols Verification


This paper shows a new way of automatic verification of properties of untimed and timed security protocols. To do this we use a modified version of previously introduced formal model based on a network of synchronized (timed) automata that expreses behaviour and distributed knowledge of users during protocol executions. In our new approach we will use the backward induction method for searching of a tree of all real executions of an investigated protocol. Our approach uses additionally the boolean encoding of constructed structures and SAT solvers for searching answers to the questions about investigated properties which are expressed as reachability or unreachability of undesired states in a considered model. We exemplify all our notions and formalisms on the well known NSPK, and show experimental results for checking authentication and security properties of a few untimed and timed protocols.
Fichier principal
Vignette du fichier
978-3-642-40925-7_25_Chapter.pdf (130.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01496073 , version 1 (27-03-2017)





Mirosław Kurkowski, Olga Siedlecka-Lamch, Paweł Dudek. Using Backward Induction Techniques in (Timed) Security Protocols Verification. 12th International Conference on Information Systems and Industrial Management (CISIM), Sep 2013, Krakow, Poland. pp.265-276, ⟨10.1007/978-3-642-40925-7_25⟩. ⟨hal-01496073⟩
122 View
78 Download



Gmail Facebook X LinkedIn More