An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Stronger security of authenticated key exchange
ProvSec'07 Proceedings of the 1st international conference on Provable security
Abstraction by set-membership: verifying security protocols and web services with databases
Proceedings of the 17th ACM conference on Computer and communications security
Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach
Journal of Automated Reasoning
StatVerif: Verification of Stateful Processes
CSF '11 Proceedings of the 2011 IEEE 24th Computer Security Foundations Symposium
Formal Analysis of Protocols Based on TPM State Registers
CSF '11 Proceedings of the 2011 IEEE 24th Computer Security Foundations Symposium
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings
CSF '12 Proceedings of the 2012 IEEE 25th Computer Security Foundations Symposium
Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties
CSF '12 Proceedings of the 2012 IEEE 25th Computer Security Foundations Symposium
| Hi-index | 0.00 |
The Tamarin prover supports the automated, unbounded, symbolic analysis of security protocols. It features expressive languages for specifying protocols, adversary models, and properties, and support for efficient deduction and equational reasoning. We provide an overview of the tool and its applications.