Deciding Security for Protocols with Recursive Tests
From MaRDI portal
Publication:5200014
DOI10.1007/978-3-642-22438-6_6zbMath1341.68013OpenAlexW2179021181MaRDI QIDQ5200014
Véronique Cortier, Stéphanie Delaune, Mathilde Arnaud
Publication date: 29 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22438-6_6
Related Items
Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later ⋮ Deciding Security for Protocols with Recursive Tests
Uses Software
Cites Work
- Deciding knowledge in security protocols under equational theories
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Deciding security properties for cryptographic protocols. application to key cycles
- On the Automatic Analysis of Recursive Security Protocols with XOR
- Deciding Security for Protocols with Recursive Tests
- STACS 2004
- Computer Aided Verification
- CONCUR 2005 – Concurrency Theory