Verifying Cryptographic Protocols with Subterms Constraints
From MaRDI portal
Recommendations
Cites work
- A comparison between strand spaces and multiset rewriting for security protocol analysis
- Algebraic Intruder Deductions
- Automatic SAT-compilation of protocol insecurity problems via reduction to planning
- Deciding Key Cycles for Security Protocols
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- On the relationship between web services security and traditional protocols
- On the relative soundness of the free algebra model for public key encryption
- On the security of public key protocols
- On the symbolic reduction of processes with cryptographic functions.
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Towards an automatic analysis of security protocols in first-order logic
- TulaFale: a security tool for web services
- Unification in the union of disjoint equational theories: Combining decision procedures
Cited in
(5)- Verification of cryptographic protocols: tagging enforces termination
- scientific article; zbMATH DE number 3877090 (Why is no real title available?)
- Computer Science Logic
- Probabilistic relational verification for cryptographic implementations
- Key Substitution in the Symbolic Analysis of Cryptographic Protocols
This page was built for publication: Verifying Cryptographic Protocols with Subterms Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498465)