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. In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09), pp. 148–163, Lecture Notes in Computer Science 5595, Springer, Brasília, Brazil, June 2009.

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 all the existing decision procedures for convergent theories. We also provide an efficient implementation, and compare it briefly with the more general tool ProVerif.

BibTeX

@inproceedings{BCD-rta09,
  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 all
                   the existing decision procedures for convergent
                   theories. We also provide an efficient
                   implementation, and compare it briefly with the more
                   general tool ProVerif.},
  address =       {Bras{\'\i}lia, Brazil},
  author =        {Baudet, Mathieu and Cortier, V{\'e}ronique and
                   Delaune, St{\'e}phanie},
  booktitle =     {{P}roceedings of the 20th {I}nternational
                   {C}onference on {R}ewriting {T}echniques and
                   {A}pplications ({RTA}'09)},
  OPTDOI =           {10.1007/978-3-642-02348-4_11},
  editor =        {Treinen, Ralf},
  month =         jun,
  pages =         {148-163},
  publisher =     {Springer},
  series =        {Lecture Notes in Computer Science},
  title =         {{YAPA}: A~generic tool for computing intruder
                   knowledge},
  volume =        {5595},
  year =          {2009},
  acronym =       {{RTA}'09},
  nmonth =        {6},
  OPTLONGPDF =       {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/
                   rr-lsv-2009-03.pdf},
  lsv-category =  {intc},
  wwwpublic =     {public and ccsb},
}