Typing messages for free in security protocols: the case of equivalence propertiesReport as inadecuate




Typing messages for free in security protocols: the case of equivalence properties - Download this document for free, or read online. Document in PDF available to download.

1 LSV - Laboratoire Spécification et Vérification Cachan 2 CASSIS - Combination of approaches to the security of infinite states systems FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods

Abstract : Our first main contribution is to reduce the search space for attacks. Specifically, we show that if there is an attack then there is one that is well-typed. Our result holds for a large class of typing systems and a large class of determinate security protocols. Assuming finitely many nonces and keys, we can derive from this result that trace equivalence is decidable for an unbounded number of sessions for a class of tagged protocols, yielding one of the first decidability results for the unbounded case. As an intermediate result, we also provide a novel decision procedure in the case of a bounded number of sessions.





Author: Rémy Chrétien - Véronique Cortier - Stéphanie Delaune -

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



DOWNLOAD PDF




Related documents