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)

zbMATH Keywords

testingtheorem provingregualr tree languages

Mathematics Subject Classification ID

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

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

(24)

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

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)