The following pages link to (Q4447230):
Displayed 12 items.
- Bounding messages for free in security protocols -- extension to various security properties (Q476179) (← links)
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach (Q540685) (← links)
- A method for symbolic analysis of security protocols (Q557806) (← links)
- Safely composing security protocols (Q1028731) (← links)
- Verification of cryptographic protocols: tagging enforces termination (Q1770413) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically (Q2484410) (← links)
- A symbolic decision procedure for cryptographic protocols with time stamps (Q2568115) (← links)
- Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (Q3636822) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)