Abstracting cryptographic protocols with tree automata.

DOI10.1016/S0167-6423(02)00132-6zbMath1047.68066MaRDI QIDQ1398674

David Monniaux

Publication date: 7 August 2003

Published in: Science of Computer Programming (Search for Journal in Brave)

zbMATH Keywords

theorem provingtestingregualr tree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25)

Related Items (4)

Automated verification of selected equivalences for security protocols ⋮ Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives ⋮ Parameterized complexity of basic decision problems for tree automata ⋮ Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif

This page was built for publication: Abstracting cryptographic protocols with tree automata.