Automating Security Analysis: Symbolic Equivalence of Constraint Systems

We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity or strong secrecy). Infinite sets of possible traces are symbolically represented using deducibility constraints. We give a new algorithm that decides the trace equivalence for the traces that are represented using such constraints, in the case of signatures, symmetric and asymmetric encryptions. Our algorithm is implemented and performs well on typical benchmarks. This is the first implemented algorithm, deciding symbolic trace equivalence.

• Type: Conference
• Year: 2010
• Where: CADE
• Authors: Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune
• Keywords: CADE 2010, Equivalence Properties, Logical Reasoning, Symbolic Trace Equivalence, Trace Equivalence