Skip to Main content Skip to Navigation
Journal articles

YAPA: A generic tool for computing intruder knowledge

Mathieu Baudet 1 Véronique Cortier 2 Stéphanie Delaune 3
2 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
3 SECSI - Security of information systems
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
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 most of the existing decision procedures for convergent theories. We also provide an efficient implementation, and compare it briefly with the tools ProVerif and KiSs.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-00732901
Contributor : Véronique Cortier <>
Submitted on : Monday, September 17, 2012 - 1:20:02 PM
Last modification on : Monday, February 15, 2021 - 10:51:35 AM

Identifiers

Citation

Mathieu Baudet, Véronique Cortier, Stéphanie Delaune. YAPA: A generic tool for computing intruder knowledge. ACM Transactions on Computational Logic, Association for Computing Machinery, 2013, 14 (1), ⟨10.1145/2422085.2422089⟩. ⟨hal-00732901⟩

Share

Metrics

Record views

454