Comparing State Spaces in Automatic Security Protocol Analysis

DOI10.1007/978-3-642-02002-5_5zbMATH Open1242.94022OpenAlexW1499326294MaRDI QIDQ3631370FDOQ3631370

Authors: 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

Recommendations

• State space reduction in the Maude-NRL protocol analyzer
• scientific article; zbMATH DE number 1927581
• Cryptographic protocol security analysis based on bounded constructing algorithm
• Trustworthy Global Computing
• The CL-Atse Protocol Analyser

Mathematics Subject Classification ID

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

Cites Work

• Computer Aided Verification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using encryption for authentication in large networks of computers
• Applied finite group actions.
• A logic of authentication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The CL-Atse Protocol Analyser
• Security properties: two agents are sufficient
• Title not available (Why is that?)
• Title not available (Why is that?)
• Injective synchronisation: An extension of the authentication hierarchy
• An optimized intruder model for SAT-based model-checking of security protocols
• An Obvious Proof of Burnside's Lemma

Cited In (4)

• Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
• State space reduction in the Maude-NRL protocol analyzer
• Cross-tool semantics for protocol security goals
• Formal analysis and offline monitoring of electronic exams

Uses Software

• HERMES
• AVISPA
• Casper
• scyther

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

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