Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
From MaRDI portal
Recommendations
Cites work
- Abstracting cryptographic protocols with tree automata.
- Automated verification of selected equivalences for security protocols
- Automatic Analysis of the Security of XOR-Based Key Management Schemes
- Comparing State Spaces in Automatic Security Protocol Analysis
- Computer Aided Verification
- Handling Algebraic Properties in Automatic Analysis of Security Protocols
- Handling left-quadratic rules when completing tree automata
- scientific article; zbMATH DE number 1614701 (Why is no real title available?)
- scientific article; zbMATH DE number 1956589 (Why is no real title available?)
- scientific article; zbMATH DE number 1882021 (Why is no real title available?)
- On the security of public key protocols
- Reachability analysis over term rewriting systems
- The CL-Atse Protocol Analyser
- The NRL Protocol Analyzer: An Overview
Cited in
(4)- An attack-finding algorithm for security protocols.
- Assessing security of cryptocurrencies with attack-defense trees: proof of concept and future directions
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
- Handling Algebraic Properties in Automatic Analysis of Security Protocols
This page was built for publication: Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179050)