Symbolic Protocol Analysis in the Union of Disjoint Intruder Theories: Combining Decision Procedures

Yannick Chevalier 1 Michael Rusinowitch 2
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 Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples of such sets of operators comprise XOR, multiplication, abstract encryption/decryption. In this report we give an algorithm for combining decision procedures for arbitrary intruder theories with disjoint sets of operators, provided that solvability of ordered intruder constraints, a slight generalization of intruder constraints, can be decided in each theory. This is the case for most of the intruder theories for which a decision procedure has been given. In particular our result allows us to decide trace-based security properties of protocols that employ any combination of the above mentioned operators with a bounded number of sessions.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2010, 411 (10), pp.1261-1282. 〈10.1016/j.tcs.2009.10.022〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00455290
Contributeur : Michaël Rusinowitch <>
Soumis le : mercredi 10 février 2010 - 09:29:00
Dernière modification le : mercredi 23 mai 2018 - 17:58:06

Lien texte intégral

Identifiants

Citation

Yannick Chevalier, Michael Rusinowitch. Symbolic Protocol Analysis in the Union of Disjoint Intruder Theories: Combining Decision Procedures. Theoretical Computer Science, Elsevier, 2010, 411 (10), pp.1261-1282. 〈10.1016/j.tcs.2009.10.022〉. 〈inria-00455290〉

Partager

Métriques

Consultations de la notice

261