Deciding knowledge in security protocols under (many more) equational theories - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Deciding knowledge in security protocols under (many more) equational theories

Résumé

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.

Dates et versions

inria-00000554 , version 1 (02-11-2005)

Identifiants

Citer

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⟩
114 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More