Abstracting cryptographic protocols with tree automata

DOI10.1007/3-540-48294-6_10MaRDI QIDQ4494379zbMATH OpenFDO

Authors David Monniaux

Publication date 11 December 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48294-6_10

zbMATH Keywords

abstract interpretationanalysis cryptographic protocolsregular tree languages

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(21)

• Abstracting cryptographic protocols with tree automata.
• Tree automata with one memory set constraints and cryptographic protocols
• On the symbolic reduction of processes with cryptographic functions.
• Alternating two-way AC-tree automata
• Transducer-based analysis of cryptographic protocols
• Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
• A static analysis of cryptographic processes: the denotational approach
• scientific article; zbMATH DE number 1614701 (Why is no real title available?)
• Abstract interpretation for proving secrecy properties in security protocols
• Information based reasoning about security protocols
• 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 1754629 (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
• Automated Deduction – CADE-20
• Trustworthy Global Computing
• Abstract State Machines 2004. Advances in Theory and Practice
• Efficient representation of the attacker's knowledge in cryptographic protocols analysis

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 Q4494379)