• Publications
  • Influence
The TAMARIN Prover for the Symbolic Analysis of Security Protocols
The Tamarin prover supports the automated, unbounded, symbolic analysis of security protocols. It features expressive languages for specifying protocols, adversary models, and properties, and support
Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties
TLDR
A general approach for the symbolic analysis of security protocols that use Diffie-Hellman exponentiation to achieve advanced security properties using a novel constraint-solving algorithm that supports both falsification and verification, even in the presence of an unbounded number of protocol sessions.
EasyCrypt: A Tutorial
TLDR
Machine-checked frameworks that support the construction and automated verification of cryptographic systems are developed to reason directly in the computational model commonly used by cryptographers to deliver rigorous and detailed mathematical proofs.
Jasmin: High-Assurance and High-Speed Cryptography
TLDR
Using the supercop framework, this work evaluates the Jasmin compiler on representative cryptographic routines and concludes that the code generated by the compiler is as efficient as fast, hand-crafted, implementations.
Formal analysis of key exchange protocols and physical protocols
TLDR
A general approach for the automated symbolic analysis of security protocols that use Diffie-Hellman exponentiation and bilinear pairings to achieve advanced security properties is presented, and a framework for the interactive analysis of protocols that establish and rely on properties of the physical world is developed.
Fully automated analysis of padding-based encryption in the computational model
TLDR
This paper presents proof systems for analyzing the chosen-plaintext and chosen-ciphertext security of public-key encryption schemes built from trapdoor permutations and hash functions in the random oracle model, and develops a toolset that bundles together fully automated proof and attack finding algorithms.
Strongly-optimal structure preserving signatures from Type II pairings: synthesis and lower bounds
Recent work on structure-preserving signatures studies optimality of these schemes in terms of the number of group elements needed in the verification key and the signature, and the number of
Automated Analysis of Cryptographic Assumptions in Generic Group Models
TLDR
A very general master theorem is formulated that formally relates the hardness of a (possibly interactive) assumption in generic group models to solving problems in polynomial algebra.
Automated Verification of Group Key Agreement Protocols
TLDR
This work provides the first symbolic correctness proofs for group key agreement protocols that use Diffie-Hellman or bilinear pairing, loops, and recursion, while at the same time supporting advanced security properties, such as perfect forward secrecy and eCK-security.
Let's Get Physical: Models and Methods for Real-World Security Protocols
TLDR
An abstract message theory is developed that formalizes protocol-independent facts about messages, which hold for all instances when verifying protocols, and is used to verify distance bounding protocols where the concrete message theory includes exclusive-or.
...
...