On the decidability of cryptographic protocols with open-ended data structures

DOI10.1007/3-540-45694-5_34MaRDI QIDQ4484508zbMATH OpenFDO

Authors Ralf Küsters

Publication date 12 June 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2421/24210515.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Transducer-based analysis of cryptographic protocols
• Analysis of security protocols as open systems
• STACS 2004
• Programming Languages and Systems
• scientific article; zbMATH DE number 2163007

Cited in

(9)

• On the freedom of decryption
• Transducer-based analysis of cryptographic protocols
• Verifying Cryptographic Protocols with Subterms Constraints
• scientific article; zbMATH DE number 4053510 (Why is no real title available?)
• New decidability results for fragments of first-order logic and application to cryptographic protocols
• scientific article; zbMATH DE number 2163007 (Why is no real title available?)
• Programming Languages and Systems
• An NP decision procedure for protocol insecurity with XOR
• Simulation relations for alternating Büchi automata

This page was built for publication: On the decidability of cryptographic protocols with open-ended data structures

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