Selected publications at LSV

Abstract:: When formally analyzing security protocols it is often important to express properties in terms of an adversary's inability to distinguish two protocols. It has been shown that this problem amounts to deciding the equivalence of two constraint systems, i.e., whether they have the same set of solutions. In this paper we study this equivalence problem when cryptographic primitives are modeled using a group equational theory, a special case of monoidal equational theories. The results strongly rely on the isomorphism between group theories and rings. This allows us to reduce the problem under study to the problem of solving systems of equations over rings.
We provide several new decidability and complexity results, notably for equational theories which have applications in security protocols, such as exclusive or and Abelian groups which may additionally admit a unary, homomorphic symbol.

`@inproceedings{DKP-ijcar12,`
	`address =`	`{Manchester, UK},`
	`author =`	`{Delaune, St{\'e}phanie and Kremer, Steve and Pasail{\u{a}}, Daniel},`
	`booktitle =`	`{{P}roceedings of the 6th {I}nternational {J}oint {C}onference on {A}utomated {R}easoning ({IJCAR}'12)},`
	`DOI =`	`{10.1007/978-3-642-31365-3_15},`
	`editor =`	`{Gramlich, Bernhard and Miller, Dale and Sattler, Uli},`
	`month =`	`jun,`
	`pages =`	`{164-178},`
	`publisher =`	`{Springer-Verlag},`
	`series =`	`{Lecture Notes in Artificial Intelligence},`
	`title =`	`{Security protocols, constraint systems, and group theories},`
	`url =`	`{http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKP-ijcar12.pdf},`
	`volume =`	`{7364},`
	`year =`	`{2012},`
`}`

About LSV