Decidability issues for extended ping-pong protocols

DOI10.1007/S10817-005-9015-9zbMATH Open1107.68042OpenAlexW2140498954MaRDI QIDQ861694FDOQ861694

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) Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Verification on infinite structures.
• On the security of ping-pong protocols
• On the symbolic reduction of processes with cryptographic functions.
• On the security of public key protocols
• Process rewrite systems.
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Regular canonical systems
• Foundations of Software Science and Computation Structures
• CONCUR 2004 - Concurrency Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Reachability is decidable for weakly extended process rewrite systems

This page was built for publication: Decidability issues for extended ping-pong protocols

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