Decidability issues for extended ping-pong protocols

DOI10.1007/s10817-005-9015-9zbMath1107.68042OpenAlexW2140498954MaRDI QIDQ861694

Hans Hüttel, Jiří Srba

Publication date: 30 January 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-005-9015-9

zbMATH Keywords

cryptographic protocolsformal modeling

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Reachability is decidable for weakly extended process rewrite systems

Cites Work

• On the symbolic reduction of processes with cryptographic functions.
• Process rewrite systems.
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• On the security of ping-pong protocols
• On the security of public key protocols
• Foundations of Software Science and Computation Structures
• CONCUR 2004 - Concurrency Theory
• Regular canonical systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item