Abstracting cryptographic protocols with tree automata.

DOI10.1016/S0167-6423(02)00132-6MaRDI QIDQ1398674zbMATH OpenFDO

Authors David Monniaux

Publication date 7 August 2003

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

Full work available at URL https://doi.org/10.1016/S0167-6423(02)00132-6

zbMATH Keywords

regualr tree languagestestingtheorem proving

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1487854
• Abstract interpretation for proving secrecy properties in security protocols
• scientific article; zbMATH DE number 1832234
• scientific article; zbMATH DE number 1956589
• Tree automata with one memory set constraints and cryptographic protocols

Cited in

(26)

• A domain-specific language for cryptographic protocols based on streams
• Tree automata with one memory set constraints and cryptographic protocols
• Analysis of security protocols as open systems
• Automated verification of selected equivalences for security protocols
• scientific article; zbMATH DE number 1614701 (Why is no real title available?)
• scientific article; zbMATH DE number 1670560 (Why is no real title available?)
• scientific article; zbMATH DE number 1696763 (Why is no real title available?)
• Abstract interpretation for proving secrecy properties in security protocols
• Information based reasoning about security protocols
• Parameterized complexity of basic decision problems for tree automata
• scientific article; zbMATH DE number 1330434 (Why is no real title available?)
• scientific article; zbMATH DE number 1951201 (Why is no real title available?)
• scientific article; zbMATH DE number 1956589 (Why is no real title available?)
• scientific article; zbMATH DE number 2079665 (Why is no real title available?)
• scientific article; zbMATH DE number 1487854 (Why is no real title available?)
• scientific article; zbMATH DE number 1754628 (Why is no real title available?)
• scientific article; zbMATH DE number 1754629 (Why is no real title available?)
• scientific article; zbMATH DE number 1929965 (Why is no real title available?)
• scientific article; zbMATH DE number 1832234 (Why is no real title available?)
• Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
• Automatic verification of security protocols in the symbolic model: the verifier ProVerif
• Automated Deduction – CADE-20
• Trustworthy Global Computing
• Searching for Shapes in Cryptographic Protocols
• Abstract State Machines 2004. Advances in Theory and Practice
• Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA

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

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