Hierarchical combination of intruder theories - Archive ouverte HAL Access content directly
Journal Articles Information and Computation Year : 2008

Hierarchical combination of intruder theories

(1, 2, 3) , (1)
1
2
3

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.
Fichier principal
Vignette du fichier
main.pdf (333.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00329715 , version 1 (13-10-2008)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More