Computer Science – Logic in Computer Science
Scientific paper
2010-05-05
Computer Science
Logic in Computer Science
Scientific paper
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.
Baudet Mathieu
Cortier Véronique
Delaune Stéphanie
No associations
LandOfFree
YAPA: A generic tool for computing intruder knowledge does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with YAPA: A generic tool for computing intruder knowledge, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and YAPA: A generic tool for computing intruder knowledge will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-436910