Skip to Main content Skip to Navigation
Conference papers

YAPA: A generic tool for computing intruder knowledge

Mathieu Baudet Véronique Cortier 1 Stéphanie Delaune 2 
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages based on equational logics, knowledge is typically expressed by two relations: deducibility and static equivalence. Several decision procedures have been proposed for these relations under a variety of equational theories. However, each theory has its particular algorithm, and none has been implemented so far. We provide a generic procedure for deducibility and static equivalence that takes as input any convergent rewrite system. We show that our algorithm covers all the existing decision procedures for convergent theories. We also provide an efficient implementation, and compare it briefly with the more general tool ProVerif.
Document type :
Conference papers
Complete list of metadata
Contributor : Véronique Cortier Connect in order to contact the contributor
Submitted on : Tuesday, October 27, 2009 - 9:44:04 AM
Last modification on : Friday, January 21, 2022 - 3:08:59 AM

Links full text



Mathieu Baudet, Véronique Cortier, Stéphanie Delaune. YAPA: A generic tool for computing intruder knowledge. 20th International Conference on Rewriting Techniques and Applications - RTA'09, Jun 2009, Brasilia, Brazil. pp.148-163, ⟨10.1007/978-3-642-02348-4_11⟩. ⟨inria-00426624⟩



Record views