| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
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 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.
Cited literature [18 references]
https://hal.inria.fr/inria-00636797
Contributor : Steve Kremer Connect in order to contact the contributor
Submitted on : Wednesday, October 7, 2015 - 10:33:20 PM
Last modification on : Friday, October 22, 2021 - 4:41:02 AM
Long-term archiving on: : Friday, January 8, 2016 - 10:56:27 AM
Contributor : Steve Kremer Connect in order to contact the contributor
Submitted on : Wednesday, October 7, 2015 - 10:33:20 PM
Last modification on : Friday, October 22, 2021 - 4:41:02 AM
Long-term archiving on: : Friday, January 8, 2016 - 10:56:27 AM
File
KMT-jar10.pdf
Files produced by the author(s)