HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Deciding knowledge in security protocols under equational theories

Martin Abadi 1 Véronique Cortier 2
2 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 :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 10:13:04 AM
Last modification on : Friday, January 21, 2022 - 3:09:06 AM

Links full text



Martin Abadi, Véronique Cortier. Deciding knowledge in security protocols under equational theories. ICALP 2004 - The 31st International Colloquium on Automata, Languages and Programming, Jul 2004, Turku, Finland. pp.148-164, ⟨10.1007/978-3-540-27836-8_7⟩. ⟨inria-00099982⟩



Record views