Skip to Main content Skip to Navigation
Journal articles

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

Yannick Chevalier 1, 2 Michael Rusinowitch 3
1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
IRIT - Institut de recherche en informatique de Toulouse
3 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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.
Document type :
Journal articles
Complete list of metadata
Contributor : Michaël Rusinowitch Connect in order to contact the contributor
Submitted on : Wednesday, February 10, 2010 - 9:29:00 AM
Last modification on : Tuesday, October 19, 2021 - 2:23:32 PM

Links full text



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⟩



Record views