Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives

DOI10.1016/j.entcs.2009.05.030zbMath1347.94020OpenAlexW2076527924MaRDI QIDQ5179050

Olga Kouchnarenko, Pierre-Cyrille Héam, Yohan Boichut

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.030

zbMATH Keywords

security protocolalgebraic propertiesautomatic approximation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Grammars and rewriting systems (68Q42)

Related Items (1)

The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols

Uses Software

• AVISPA
• Timbuk
• Maude-NPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability analysis over term rewriting systems
• Abstracting cryptographic protocols with tree automata.
• Automated verification of selected equivalences for security protocols
• The NRL Protocol Analyzer: An Overview
• Handling Algebraic Properties in Automatic Analysis of Security Protocols
• The CL-Atse Protocol Analyser
• Comparing State Spaces in Automatic Security Protocol Analysis
• On the security of public key protocols
• Handling Left-Quadratic Rules When Completing Tree Automata
• Computer Aided Verification
• Automatic Analysis of the Security of XOR-Based Key Management Schemes

This page was built for publication: Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives