Sciweavers

Share
ASIAN
2009
Springer

Reducing Equational Theories for the Decision of Static Equivalence

10 years 3 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. 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 a more accurate representation of cryptographic primitives by modelling properties of operators by equational axioms. We develop a method that allows 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.
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
Added 08 Nov 2010
Updated 08 Nov 2010
Type Conference
Year 2009
Where ASIAN
Authors Steve Kremer, Antoine Mercier 0002, Ralf Treinen
Comments (0)
books