Transducer-based analysis of cryptographic protocols

DOI10.1016/J.IC.2007.08.003zbMath1132.68028OpenAlexW2005317419MaRDI QIDQ2464141

Thomas Wilke, Ralf Küsters

Publication date: 10 December 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2007.08.003

zbMATH Keywords

decidabilitycryptographic protocolstransducersautomatic analysis

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (5)

Decision Problems of Tree Transducers with Origin ⋮ Decision problems of tree transducers with origin ⋮ How to decide functionality of compositions of top-down tree transducers ⋮ Definability Results for Top-Down Tree Transducers ⋮ Functionality of compositions of top-down tree transducers is decidable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An attack on the Needham-Schroeder public-key authentication protocol
• Haskell overloading is DEXPTIME-complete
• XML with data values: Typechecking revisited.
• On the symbolic reduction of processes with cryptographic functions.
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• On the Automatic Analysis of Recursive Security Protocols with XOR
• On the security of public key protocols
• Three hierarchies of transducers
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Programming Languages and Systems
• STACS 2004
• Automated Deduction – CADE-20
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Transducer-based analysis of cryptographic protocols