Rewriting for Cryptographic Protocol Verification - Extended VersionReport as inadecuate




Rewriting for Cryptographic Protocol Verification - Extended Version - Download this document for free, or read online. Document in PDF available to download.

1 Lande - Logiciel : ANalyse et DEveloppement IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique 2 FT R&D - France Télécom Recherche & Développement

Abstract : On a case study, we present a new approach for verifying cryptographic protocols, based on rewriting and on tree automata techniques. Protocols are operationally described using Term Rewriting Systems and the initial set of communication requests is described by a tree automaton. Starting from these two representations, we automatically compute an over-approximation of the set of exchanged messages also recognized by a tree automaton. Then, proving classical properties like confidentiality or authentication can be done by automatically showing that the intersection between the approximation and a set of prohibited behaviors is the empty set. Furthermore, this method enjoys a simple and powerful way to describe intruder work, the ability to consider an unbounded number of parties, an unbounded number of interleaved sessions, and a theoretical property ensuring safeness of the approximation.

Keywords : DESCENDANTS PROGRAM VERIFICATION CRYPTOGRAPHIC PROTOCOL TREE AUTOMATA TERM REWRITING





Author: Thomas Genet - Francis Klay -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents