Skip to Main content Skip to Navigation
Journal articles

Computing knowledge in security protocols under convergent equational theories

Stefan Ciobaca 1 Stéphanie Delaune 1, 2 Steve Kremer 2, 3
2 SECSI - Security of information systems
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
3 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 reasoning about the knowledge an attacker acquires by eavesdropping on network traffic. In formal approaches, the messages exchanged over the network are modeled by a term algebra equipped with an equational theory axiomatizing the properties of the cryptographic primitives (e.g. encryption, signature). In this context, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems.\par We propose a procedure for both problems under arbitrary convergent equational theories. Since the underlying problems are undecidable we cannot guarantee termination. Nevertheless, our procedure terminates on a wide range of equational theories. In particular, we obtain a new decidability result for a theory we encountered when studying electronic voting protocols. We also provide a prototype implementation.
Document type :
Journal articles
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download
Contributor : Steve Kremer <>
Submitted on : Wednesday, October 7, 2015 - 10:31:49 PM
Last modification on : Wednesday, September 16, 2020 - 10:43:31 AM
Long-term archiving on: : Friday, January 8, 2016 - 10:56:18 AM


Files produced by the author(s)



Stefan Ciobaca, Stéphanie Delaune, Steve Kremer. Computing knowledge in security protocols under convergent equational theories. Journal of Automated Reasoning, Springer Verlag, 2012, 48 (2), pp.219-262. ⟨10.1007/s10817-010-9197-7⟩. ⟨inria-00636794⟩



Record views


Files downloads