Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

YAPA: A Generic Tool for Computing Intruder Knowledge

YAPA: A Generic Tool for Computing Intruder Knowledge YAPA: A Generic Tool for Computing Intruder Knowledge MATHIEU BAUDET, MLstate ´ VERONIQUE CORTIER, LORIA - CNRS ´ STEPHANIE DELAUNE, LSV, ENS Cachan & CNRS & INRIA Saclay Ile-de-France 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. Categories and Subject Descriptors: F.3.1 [Logics and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs General Terms: Security Additional Key Words and Phrases: Formal proofs, security protocols, verification, deduction, static equivalence ACM Reference Format: Baudet, M., Cortier, V., and Delaune, S. 2013. YAPA: A generic http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/yapa-a-generic-tool-for-computing-intruder-knowledge-NQLMarJu31

References (54)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2013 by ACM Inc.
ISSN
1529-3785
DOI
10.1145/2422085.2422089
Publisher site
See Article on Publisher Site

Abstract

YAPA: A Generic Tool for Computing Intruder Knowledge MATHIEU BAUDET, MLstate ´ VERONIQUE CORTIER, LORIA - CNRS ´ STEPHANIE DELAUNE, LSV, ENS Cachan & CNRS & INRIA Saclay Ile-de-France 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. Categories and Subject Descriptors: F.3.1 [Logics and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs General Terms: Security Additional Key Words and Phrases: Formal proofs, security protocols, verification, deduction, static equivalence ACM Reference Format: Baudet, M., Cortier, V., and Delaune, S. 2013. YAPA: A generic

Journal

ACM Transactions on Computational Logic (TOCL)Association for Computing Machinery

Published: Feb 1, 2013

There are no references for this article.