The following pages link to (Q4535056):
Displayed 10 items.
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- Simulation relations for alternating Büchi automata (Q557801) (← links)
- A method for symbolic analysis of security protocols (Q557806) (← links)
- Verification of cryptographic protocols: tagging enforces termination (Q1770413) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (Q1874404) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically (Q2484410) (← links)