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 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.

• Type: Conference
• Year: 2007
• Where: FROCOS
• Authors: Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune
• Keywords: Disjoint Equational Theories, Equational Theories, Equational Theory, FROCOS 2007