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

Combining algorithms for deciding knowledge in security protocols


In formal approaches, messages sent over a network are usu- ally modeled by terms together with an equational theory, axiomatiz- ing the properties of the cryptographic functions (encryption, exclusive or, . . . ). The analysis of cryptographic protocols requires a precise un- derstanding of the attacker knowledge. Two standard notions are usu- ally considered: deducibility and indistinguishability. Those notions are well-studied and several decidability results already exist to deal with a variety of equational theories. However most of the results are dedicated to specific 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.
No file

Dates and versions

inria-00181609 , version 1 (24-10-2007)


  • HAL Id : inria-00181609 , version 1


Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune. Combining algorithms for deciding knowledge in security protocols. 6th International Symposium on Frontiers of Combining Systems - FroCoS'07, Sep 2007, Liverpool, United Kingdom. ⟨inria-00181609⟩
74 View
0 Download


Gmail Facebook X LinkedIn More