Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols

Abstract : The TAMARIN prover is a state-of-the-art protocol verification tool. It supports verification of both trace and equivalence properties, a rich protocol specification language that includes support for global, mutable state and allows the user to specify cryptographic primitives as an arbitrary subterm convergent equational theory, in addition to several built-in theories, which include, among others, Diffie-Hellman exponentiation. In this paper, we improve the underlying theory and the tool to allow for more general user-specified equational theories: our extension supports arbitrary con-vergent equational theories that have the finite variant property, making TAMARIN the first tool to support at the same time this large set of user-defined equational theories, protocols with global mutable state, an unbounded number of sessions, and complex security properties. We demonstrate the effectiveness of this generalization by analyzing several protocols that rely on blind signatures, trapdoor commitment schemes, and ciphertext prefixes that were previously out of scope.
Document type :
Conference papers
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-01450916
Contributor : Steve Kremer <>
Submitted on : Tuesday, January 31, 2017 - 2:42:56 PM
Last modification on : Tuesday, March 5, 2019 - 9:30:12 AM
Long-term archiving on : Monday, May 1, 2017 - 2:35:30 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01450916, version 1

Citation

Jannik Dreier, Charles Duménil, Steve Kremer, Ralf Sasse. Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols. 6th International Conference on Principles of Security and Trust (POST), Apr 2017, Uppsala, Sweden. ⟨hal-01450916v1⟩

Share

Metrics

Record views

437

Files downloads

116