Formal models and techniques for analyzing security protocols: A tutorial
Security protocols are distributed programs that aim at securing communications by the
means of cryptography. They are for instance used to secure electronic payments, home …
means of cryptography. They are for instance used to secure electronic payments, home …
On the automatic analysis of recursive security protocols with XOR
R Küsters, T Truderung - Annual Symposium on Theoretical Aspects of …, 2007 - Springer
In many security protocols, such as group protocols, principals have to perform iterative or
recursive computations. We call such protocols recursive protocols. Recently, first results on …
recursive computations. We call such protocols recursive protocols. Recently, first results on …
Deciding security for protocols with recursive tests
Security protocols aim at securing communications over public networks. Their design is
notoriously difficult and error-prone. Formal methods have shown their usefulness for …
notoriously difficult and error-prone. Formal methods have shown their usefulness for …
Selecting theories and nonce generation for recursive protocols
Truderung's selecting theory model is one of the few models of cryptographic protocols
which allows to model iterative (recursive) computations of principals and, at the same time …
which allows to model iterative (recursive) computations of principals and, at the same time …
Emerging issues and trends in formal methods in cryptographic protocol analysis: Twelve years later
C Meadows - Logic, Rewriting, and Concurrency: Essays Dedicated …, 2015 - Springer
In 2003 I published a paper “Formal Methods in Cryptographic Protocol Analysis: Emerging
Issues and Trends”, in which I identified the various open problems related to applying …
Issues and Trends”, in which I identified the various open problems related to applying …
Tree automata with equality constraints modulo equational theories
This paper presents new classes of tree automata combining automata with equality test and
automata modulo equational theories. We believe that these classes have a good potential …
automata modulo equational theories. We believe that these classes have a good potential …
Transducer-based analysis of cryptographic protocols
R Küsters, T Wilke - Information and Computation, 2007 - Elsevier
Cryptographic protocols can be divided into (1) protocols where the protocol steps are
simple from a computational point of view and can thus be modeled by simple means, for …
simple from a computational point of view and can thus be modeled by simple means, for …
Tree automata with equality constraints modulo equational theories
This paper presents new classes of tree automata combining automata with equality test and
automata modulo equational theories. We believe that these classes have a good potential …
automata modulo equational theories. We believe that these classes have a good potential …
Verification of security protocols with lists: from length one to unbounded length
M Paiola, B Blanchet - International Conference on Principles of Security …, 2012 - Springer
We present a novel, simple technique for proving secrecy properties for security protocols
that manipulate lists of unbounded length, for an unbounded number of sessions. More …
that manipulate lists of unbounded length, for an unbounded number of sessions. More …
Decidable analysis for a class of cryptographic group protocols with unbounded lists
N Chridi, M Turuani… - 2009 22nd IEEE Computer …, 2009 - ieeexplore.ieee.org
Cryptographic protocols are crucial for securing electronic transactions. The confidence in
these protocols can be increased by the formal analysis of their security properties. Although …
these protocols can be increased by the formal analysis of their security properties. Although …