Bounding Messages for Free in Security Protocols
From MaRDI portal
Bounding Messages for Free in Security Protocols
Recommendations
- Bounding messages for free in security protocols -- extension to various security properties
- scientific article; zbMATH DE number 1903362
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- A (restricted) quantifier elimination for security protocols
- Dynamic tags for security protocols
Cites work
- Bounding Messages for Free in Security Protocols
- Computer Science Logic
- Deciding Key Cycles for Security Protocols
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- Safely Composing Security Protocols
- Tree automata with one memory set constraints and cryptographic protocols
- Verification of cryptographic protocols: tagging enforces termination
Cited in
(8)- Safely composing security protocols
- Composition of password-based protocols
- Verification of security protocols with lists: from length one to unbounded length
- Bounded memory Dolev-Yao adversaries in collaborative systems
- Bounding messages for free in security protocols -- extension to various security properties
- Satisfiability of general intruder constraints with and without a set constructor
- Automatic verification of security protocols in the symbolic model: the verifier ProVerif
- Bounding Messages for Free in Security Protocols
This page was built for publication: Bounding Messages for Free in Security Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458850)