Comparing State Spaces in Automatic Security Protocol Analysis
From MaRDI portal
Publication:3631370
Recommendations
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 1948405 (Why is no real title available?)
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- scientific article; zbMATH DE number 1927582 (Why is no real title available?)
- scientific article; zbMATH DE number 1754628 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 1903364 (Why is no real title available?)
- A logic of authentication
- An Obvious Proof of Burnside's Lemma
- An optimized intruder model for SAT-based model-checking of security protocols
- Applied finite group actions.
- Computer Aided Verification
- Injective synchronisation: An extension of the authentication hierarchy
- Security properties: two agents are sufficient
- The CL-Atse Protocol Analyser
- Using encryption for authentication in large networks of computers
Cited in
(4)
This page was built for publication: Comparing State Spaces in Automatic Security Protocol Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631370)