Skip to Main content Skip to Navigation

Combining algorithms for deciding knowledge in security protocols

Mathilde Arnaud 1 Véronique Cortier 1 Stéphanie Delaune 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 Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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.
Document type :
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Thursday, February 8, 2007 - 5:13:40 PM
Last modification on : Friday, January 21, 2022 - 3:08:52 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 12:38:18 PM


Files produced by the author(s)


  • HAL Id : inria-00129418, version 2


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



Record views


Files downloads