Watch U - La webTV de l'UDA ! https://webtv.u-clermont1.fr Toutes les dernières vidéos de l'Université d'Auvergne. Toutes les dernières vidéos de l'Université d'Auvergne. Sun, 25 Jun 2017 00:00:00 +0200 2017 <![CDATA[Séminaire confiance numérique (Vincent Cheval, LORIA, Equipe INRIA PESTO)]]> https://webtv.u-clermont1.fr/media-MEDIA170202163059632

Complexity of automatic verification of cryptographic protocols

Many security properties are naturally expressed in terms of indistinguishability.

In symbolic protocol models the notion of indistinguishability can be expressed as trace equivalence in a cryptographic process calculus. Current automated verification tools are however limited even for a bounded number of sessions: they are either restricted to support only a particular set of cryptographic primitives, do not allow for protocols with else branches, or can only approximate trace equivalence, allowing for false attacks. Moreover, the complexity of these algorithms has never been studied.

In this work, we study the complexity of deciding equivalence properties, for several classes of protocols and several equivalences.

]]>
Thu, 02 Feb 2017 04:30:00 +0100