Tree automata with one memory set constraints and cryptographic protocols

DOI10.1016/J.TCS.2004.09.036MaRDI QIDQ1770429zbMATH OpenOpenAlexFDO

Authors Hubert Comon, Véronique Cortier

Publication date 6 April 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.09.036

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1754629
• Abstracting cryptographic protocols with tree automata.
• scientific article; zbMATH DE number 1487854
• STACS 2004
• Automated Deduction – CADE-20

Cites work

• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1962758 (Why is no real title available?)
• scientific article; zbMATH DE number 1754629 (Why is no real title available?)
• scientific article; zbMATH DE number 1759624 (Why is no real title available?)
• A calculus for cryptographic protocols: The spi calculus
• Haskell overloading is DEXPTIME-complete
• Introduction to set constraint-based program analysis
• On the security of ping-pong protocols
• Set constraints with intersection
• Tree automata with one memory set constraints and cryptographic protocols

Cited in

(19)

• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Abstracting cryptographic protocols with tree automata.
• Nested Sibling Tree Automata
• Automata-based verification of programs with tree updates
• scientific article; zbMATH DE number 1754629 (Why is no real title available?)
• Alternating two-way AC-tree automata
• TAGED Approximations for Temporal Properties Model-Checking
• An undecidability result for AGh
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
• Tree Automata with Global Constraints
• Tree automata with one memory set constraints and cryptographic protocols
• Bounding Messages for Free in Security Protocols
• Challenges in the Automated Verification of Security Protocols
• Bounding messages for free in security protocols -- extension to various security properties
• Rigid tree automata and applications
• Sufficient completeness verification for conditional and constrained TRS
• Rigid Tree Automata
• Automated Deduction – CADE-20
• Tree automata with global constraints

This page was built for publication: Tree automata with one memory set constraints and cryptographic protocols

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