Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
From MaRDI portal
Recommendations
- Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
- Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
- Automated Deduction – CADE-20
- Protocol Verification Via Rigid/Flexible Resolution
Cited in
(8)- Safely composing security protocols
- Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
- Deciding the Inductive Validity of ∀ ∃ * Queries
- The blossom of finite semantic trees
- Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying
- Automated Deduction – CADE-20
- Safely Composing Security Protocols
This page was built for publication: Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705952)