Deciding security for protocols with recursive tests

DOI10.1007/978-3-642-22438-6_6zbMATH Open1341.68013OpenAlexW2179021181MaRDI QIDQ5200014FDOQ5200014

Authors: Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune 

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

Recommendations

• STACS 2004
• On the Automatic Analysis of Recursive Security Protocols with XOR
• Transducer-based analysis of cryptographic protocols
• CONCUR 2005 – Concurrency Theory
• Deciding security properties for cryptographic protocols. application to key cycles

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Cites Work

• Computer Aided Verification
• 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
• STACS 2004
• CONCUR 2005 – Concurrency Theory
• Deciding security for protocols with recursive tests

Cited In (8)

• Deciding security properties for cryptographic protocols. application to key cycles
• Secrecy for security protocols
• Deciding security for protocols with recursive tests
• Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
• Transducer-based analysis of cryptographic protocols
• On the Automatic Analysis of Recursive Security Protocols with XOR
• STACS 2004
• Message Confidentiality Testing of Security Protocols – Passive Monitoring and Active Checking

Uses Software

• AVISPA

This page was built for publication: Deciding security for protocols with recursive tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200014)