Skip to Main content Skip to Navigation

Hierarchical combination of intruder theories

Yannick Chevalier 1, 2 Michael 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 Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weaknesses, by a more accurate modelling of operators employed by protocols. Several works have shown how to handle a single algebraic operator (associated with a fixed intruder theory) or how to combine several operators satisfying disjoint theories. However several interesting equational theories, such as exponentiation with an abelian group law for exponents remain out of the scope of these techniques. This has motivated us to introduce a new notion of hierarchical combination for non-disjoint intruder theories and to show decidability results for the deduction problem in these theories. We have also shown that under natural hypotheses hierarchical intruder constraints can be decided. This result applies to an exponentiation theory that appears to be more general than the one considered before.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download
Contributor : Michaël Rusinowitch <>
Submitted on : Monday, October 13, 2008 - 11:37:56 AM
Last modification on : Thursday, March 26, 2020 - 8:14:07 PM
Document(s) archivé(s) le : Tuesday, October 9, 2012 - 12:01:54 PM


Files produced by the author(s)



Yannick Chevalier, Michael Rusinowitch. Hierarchical combination of intruder theories. Information and Computation, Elsevier, 2008, 206 (2-4), pp.352-377. ⟨10.1016/j.ic.2007.07.004⟩. ⟨inria-00329715⟩



Record views


Files downloads