Stop Calling Them Provers: The Case for Calling ProVerif and Tamarin Symbolic Protocol Analyzers
Nadim Kobeissi's ePrint paper 2026/2683 argues that ProVerif and Tamarin should be called symbolic protocol analyzers, not provers. It audits their published soundness arguments, finding false statements, missing proofs and gaps between paper and implementation, and reproduces reported Tamarin bugs that accept false claims. It also covers model gaps in parsers and state machines, weak secrecy queries and unjustified primitive equations. The page is an abstract only.
What it is
Nadim Kobeissi's ePrint paper 2026/2683 (approved 31 October 2026, preprint, CC BY) argues that ProVerif and Tamarin should be called "symbolic protocol analyzers", not "provers". The page is an abstract only, so it gives no bug identifiers, tool versions or case studies.
How it works
The paper splits a "proved secure" claim into four dependencies: the theory, the analysis software, the protocol model and the property checked. It examines each for both tools.
On the software side, the abstract draws a distinction the catalog summary omits. ProVerif supplies no certificate for its full analysis. Tamarin replays its proof tree with its own solver, so the correctness of that code is still trusted rather than independently checked.
What to do
The paper's recommendation is to report results together with the models, assumptions and evidence behind them. It names three fixes for the model-side gaps: better models, stronger queries and computational soundness arguments. Someone still has to show that each applies to the protocol at hand.
Caveats
The author states that both tools remain useful for finding attacks and for establishing symbolic properties, including for unbounded sessions. The abstract does not say which Tamarin bugs were reproduced or which soundness statements are false, so the full text is needed to judge how far any of this affects a given model.
Technologies named here
- ProVerif
- Tamarin
Techniques named here
- Computational soundness
- Secrecy queries
- Symbolic protocol analysis
Concepts named here
- computational soundness
- Model completeness
- Nadim Kobeissi
- Primitive equations
- Proof certificate
- Proved secure claim
- Soundness audit
- symbolic model
Related in other

Rerandomizable Garbling for Arithmetic Circuits

