▸ Tamarin is built upon a multiset rewriting model
Tamarin is based on a state-transition model defined by a
state that consists of a multiset of
factsand a
rule that changes one state to another state. A particular fact can trigger several rules so one fact can make several branch. A list of transitions are called
trace. The properties to be proved on trace are called
lemmas that are in the form of the first-order logic formulae. If a formula is violated, Tamarin generates a graph showing a trace that leads to the contradicting state.
▸ Tamarin assumes the Dolev-Yao adversary
In the Tamarin execution model, all the messages are sent to the network adversary. This captures the passive adversary who can read all the messages in the network.
▸ Our impentation can be found in the public repository
The full Tamarin implementation can be found at
https://github.com/middlebox-aware-tls/matls-tamarin.git.