Automating Security Analysis: Symbolic Equivalence of Constraint Systems

  title={Automating Security Analysis: Symbolic Equivalence of Constraint Systems},
  author={Vincent Cheval and Hubert Comon-Lundh and St{\'e}phanie Delaune},
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… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 26 extracted citations


Publications referenced by this paper.
Showing 1-10 of 19 references

Decidability of Equivalence of Symbolic Derivations

Journal of Automated Reasoning • 2010
View 5 Excerpts
Highly Influenced

Deciding security of protocols against off-line guessing attacks

ACM Conference on Computer and Communications Security • 2005
View 7 Excerpts
Highly Influenced

Automating security analysis: symbolic equivalence of constraint systems

V. Cheval, H. Comon-Lundh, S. Delaune
Technical report, http://www.lsv., • 2010
View 1 Excerpt

A Method for Proving Observational Equivalence

2009 22nd IEEE Computer Security Foundations Symposium • 2009
View 5 Excerpts

An automatic security protocol verifier based on resolution theorem proving (invited tutorial)

B. Blanchet
In Proc. of 20th International Conference on Automated Deduction • 2005
View 1 Excerpt

Similar Papers

Loading similar papers…