YAPA: A generic tool for computing intruder knowledge

Mathieu Baudet, Véronique Cortier, and Stéphanie Delaune. YAPA: A generic tool for computing intruder knowledge. ACM Transactions on Computational Logic, 14(1:4), ACM Press, February 2013.

Download

[PDF] 

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.

BibTeX

@article{BCD-tocl12,
  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. \par
                   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.},
  author =        {Baudet, Mathieu and Cortier, V{\'e}ronique and
                   Delaune, St{\'e}phanie},
  OPTDOI =           {10.1145/2422085.2422089},
  journal =       {ACM Transactions on Computational Logic},
  month =         feb,
  number =        {1:4},
  publisher =     {ACM Press},
  title =         {{YAPA}: A~generic tool for computing intruder
                   knowledge},
  volume =        {14},
  year =          {2013},
  nmonth =        {2},
  lsv-category =  {jour},
  wwwpublic =     {public and ccsb},
}