Skip to Main content Skip to Navigation

Deciding knowledge in security protocols under equational theories

Martin Abadi Véronique Cortier 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 : The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in terms of message deducibility and indistinguishability relations. In this paper we study the decidability of these two relations. The messages in question may employ functions (encryption, decryption, etc.) axiomatized in an equational theory. Our main positive results say that, for a large and useful class of equational theories, deducibility and indistinguishability are both decidable in polynomial time.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 5:23:50 PM
Last modification on : Friday, January 15, 2021 - 3:24:26 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:12:14 PM


  • HAL Id : inria-00071420, version 1


Martin Abadi, Véronique Cortier. Deciding knowledge in security protocols under equational theories. [Research Report] RR-5169, INRIA. 2004, pp.22. ⟨inria-00071420⟩



Record views


Files downloads