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 (many more) 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 : In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue the study of these two relations. We establish general decidability theorems for both. These theorems require only loose, abstract conditions on the equational theory for messages. They subsume previous results for a syntactically defined class of theories that allows basic equations for functions such as encryption, decryption, and digital signatures. They also apply to many other useful theories, for example with blind digital signatures, homomorphic encryption, XOR, and other associative-commutative functions.
Complete list of metadata

Contributor : Véronique Cortier Connect in order to contact the contributor
Submitted on : Wednesday, November 2, 2005 - 2:49:12 PM
Last modification on : Friday, January 21, 2022 - 3:09:04 AM

Links full text



Martin Abadi, Véronique Cortier. Deciding knowledge in security protocols under (many more) equational theories. CSFW 2005 - 18th IEEE Computer Security Foundations Workshop, Jun 2005, Aix-en-Provence, France. pp.62-76, ⟨10.1109/CSFW.2005.14⟩. ⟨inria-00000554⟩



Record views