Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Combining Intruder Theories

Yannick Chevalier Michaël Rusinowitch 1 
1 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/exponentiation, abstract encryption/decryption. In this paper 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 mentionned operators with a bounded number of sessions.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:43:36 PM
Last modification on : Wednesday, October 26, 2022 - 8:16:15 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:22:55 PM


  • HAL Id : inria-00070512, version 1


Yannick Chevalier, Michaël Rusinowitch. Combining Intruder Theories. [Research Report] RR-5495, INRIA. 2005, pp.37. ⟨inria-00070512⟩



Record views


Files downloads