Skip to Main content Skip to Navigation
New interface
Journal articles

Decidability and combination results for two notions of knowledge in security protocols.

Véronique Cortier 1, 1 Stéphanie Delaune 2 
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 considered: deducibility and indistinguishability. Those notions are well-studied and several decidability results already exist to deal with a variety of equational theories. Most of the existing results are dedicated to specific equational theories and only few results, especially in the case of indistinguishability, have been obtained for equational theories with associative and commutative properties (AC). In this paper, we show that existing 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. We also propose a general setting for solving deducibility and indistinguishability for an important class (called monoidal ) of equational theories involving AC operators. As a consequence of these two results, new decidability and complexity results can be obtained for many relevant equational theories.
Document type :
Journal articles
Complete list of metadata
Contributor : Véronique Cortier Connect in order to contact the contributor
Submitted on : Tuesday, October 12, 2010 - 4:48:11 PM
Last modification on : Friday, January 21, 2022 - 3:09:38 AM

Links full text



Véronique Cortier, Stéphanie Delaune. Decidability and combination results for two notions of knowledge in security protocols.. Journal of Automated Reasoning, 2012, 48 (October), pp.441-487. ⟨10.1007/s10817-010-9208-8⟩. ⟨inria-00525778⟩



Record views