Deciding security for protocols with recursive tests

DOI10.1007/978-3-642-22438-6_6MaRDI QIDQ5200014zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

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

Cites work

• Computer Aided Verification
• CONCUR 2005 – Concurrency Theory
• Deciding knowledge in security protocols under equational theories
• Deciding security for protocols with recursive tests
• Deciding security properties for cryptographic protocols. application to key cycles
• On the Automatic Analysis of Recursive Security Protocols with XOR
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• STACS 2004

Cited in

(8)

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

Describes a project that uses

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)