Reducing Equational Theories for the Decision of Static Equivalence - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Reducing Equational Theories for the Decision of Static Equivalence

Résumé

Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static equivalence modulo equational theories allows for a more accurate representation of cryptographic primitives by modelling properties of operators by equational axioms. We develop a method that allows us in some cases to simplify the task of deciding static equivalence in a multi-sorted setting, by removing a symbol from the term signature and reducing the problem to several simpler equational theories. We illustrate our technique at hand of bilinear pairings.

Dates et versions

hal-00495976 , version 1 (29-06-2010)

Identifiants

Citer

Steve Kremer, Antoine Mercier, Ralf Treinen. Reducing Equational Theories for the Decision of Static Equivalence. Advances in Computer Science - ASIAN 2009, Dec 2009, Seoul, South Korea. pp.94--108, ⟨10.1007/978-3-642-10622-4_8⟩. ⟨hal-00495976⟩
38 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More