{
  "slug": "tamarin",
  "name": "Tamarin",
  "tagline": "Symbolic protocol verification with multiset rewriting",
  "maintainer": "ETH Zürich, CISPA, University of Oxford",
  "url": "https://tamarin-prover.com",
  "category": "symbolic-protocols",
  "targets": [
    "TLS 1.3",
    "5G AKA",
    "WPA2",
    "Noise",
    "EMV",
    "Messaging protocols"
  ],
  "approach": "Symbolic (Dolev-Yao) analysis over unbounded sessions with user-guided lemmas",
  "license": "Open source",
  "status": "Active, mature",
  "summary": "Tamarin is the most widely used symbolic protocol verifier for stateful, multi-role protocols. It has analysed TLS 1.3, 5G authentication, WPA2, the Noise framework and EMV, and supports interactive guidance when automation stalls.",
  "details": [
    "Tamarin models protocols as multiset rewriting rules and proves or refutes trace properties and observational equivalence. It handles loops, mutable state and Diffie-Hellman equational theories, which is why it dominates for real-world protocols."
  ],
  "strengths": [
    "Most expressive of the automatic symbolic tools.",
    "Interactive mode for hard proofs.",
    "Largest record of real protocol findings."
  ],
  "limits": [
    "Modelling skill required; non-termination is possible.",
    "Symbolic abstraction misses cryptographic weaknesses.",
    "No code connection."
  ],
  "fit": [
    "Choose Tamarin for any protocol with state, multiple roles or Diffie-Hellman."
  ],
  "references": [
    [
      "Tamarin prover",
      "https://tamarin-prover.com"
    ]
  ],
  "category_name": "Symbolic protocol analysis",
  "page": "https://sorryfree.com/frameworks/tamarin/",
  "updated": "2026-09-13"
}