The TAMARIN Prover for the Symbolic Analysis of Security Protocols
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An efficient cryptographic protocol verifier based on prolog rules
Blanchet, B. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930138 · Cited by 967
The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols
Cremers, C. J. F. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70545-1_38 · Cited by 757
Self-citationStronger Security of Authenticated Key Exchange
LaMacchia, B., Lauter, K., & Mityagin, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75670-5_1 · Cited by 695
Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties
Schmidt, B., Meier, S., Cremers, C., & Basin, D. (2012) · 2012 IEEE 25th Computer Security Foundations Symposium · doi:10.1109/csf.2012.25 · Cited by 223
Self-citationThe Finite Variant Property: How to Get Rid of Some Algebraic Properties
Comon, H., & Delaune, S. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-32033-3_22 · Cited by 157
A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties
Escobar, S., Meadows, C. A., & Meseguer, J. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.08.035 · Cited by 116
Formal Analysis of Protocols Based on TPM State Registers
Delaune, S., Kremer, S., Ryan, M. D., & Steel, G. (2011) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2011.12 · Cited by 63
StatVerif: Verification of Stateful Processes
Arapinis, M., Ritter, E., & Ryan, M. D. (2011) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2011.10 · Cited by 54
YubiSecure? Formal Security Analysis Results for the Yubikey and YubiHSM
Künnemann, R., & Steel, G. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38004-4_17 · Cited by 49
Cited by
A Formal Analysis of 5G Authentication
Basin, D., Dreier, J., Hirschi, L., Radomirovic, S., Sasse, R., & Stettler, V. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243846 · Cited by 412
Self-citationSoK: Computer-Aided Cryptography
Barbosa, M., Barthe, G., Bhargavan, K., Blanchet, B., Cremers, C., Liao, K., & Parno, B. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00008 · Cited by 143
“‡§ [26] Tamarin∗‡ [27] d SAPIC [28] CI-AtSe [29] OFMC.”
InfluentialSelf-citationTowards formal verification of IoT protocols: A Review
Hofer-Schmitz, K., & Stojanović, B. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107233 · Cited by 104
Hülsing, A., Ning, K.-C., Schwabe, P., Weber, F. J., & Zimmermann, P. R. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00030 · Cited by 75
“The symbolic proof of PQ-WireGuard uses the Tamarin prover [53], building on the symbolic proof for WireGuard.”
MethodSecure authentication in the grid: A formal analysis of DNP3 SAv5
Cremers, C., Dehnel-Wild, M., & Milner, K. (2019) · Journal of Computer Security · doi:10.3233/jcs-181139 · Cited by 27
“Our modelling and analysis of Secure Authentication v5 used the Tamarin security protocol verification tool [20].”
Self-citation
Metadata
- Authors
- Meier, S., Schmidt, B., Cremers, C., & Basin, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 696-701
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W146244851
- Cited by
- 657
- References
- 9
- FWCI
- 14.11
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.