Combining Intruder Theories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Combining Intruder Theories

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.
Fichier principal
Vignette du fichier
RR-5495.pdf (314.92 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070512 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070512 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More