Comparing State Spaces in Automatic Security Protocol Analysis

DOI10.1007/978-3-642-02002-5_5zbMath1242.94022OpenAlexW1499326294MaRDI QIDQ3631370

Pascal Lafourcade, Philippe Nadeau, C. J. F. Cremers

Publication date: 9 June 2009

Published in: Formal to Practical Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02002-5_5

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Formal analysis and offline monitoring of electronic exams ⋮ Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives

Uses Software

• HERMES
• AVISPA
• Casper
• scyther

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Injective synchronisation: An extension of the authentication hierarchy
• Applied finite group actions.
• Security properties: two agents are sufficient
• The CL-Atse Protocol Analyser
• An Obvious Proof of Burnside's Lemma
• Using encryption for authentication in large networks of computers
• A logic of authentication
• Computer Aided Verification

This page was built for publication: Comparing State Spaces in Automatic Security Protocol Analysis