Combining algorithms for deciding knowledge in security protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Combining algorithms for deciding knowledge in security protocols

Abstract

In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic functions (encryption, exclusive or, ...). The analysis of cryptographic protocols requires a precise understanding of the attacker knowledge. Two standard notions are usually used: deducibility and indistinguishability. Those notions are well-studied and a lot of decidability results already exist to deal with a variety of equational theories. We show that decidability results can be easily combined for any disjoint equational theories: if the deducibility and indistinguishability relations are decidable for two disjoint theories, they are also decidable for their union. As an application, new decidability results can be obtained using this combination theorem.
Fichier principal
Vignette du fichier
RR-6118.pdf (309.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00129418 , version 1 (07-02-2007)
inria-00129418 , version 2 (08-02-2007)

Identifiers

  • HAL Id : inria-00129418 , version 2

Cite

Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune. Combining algorithms for deciding knowledge in security protocols. [Research Report] RR-6118, INRIA. 2007. ⟨inria-00129418v2⟩
193 View
319 Download

Share

Gmail Facebook X LinkedIn More