Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols

DOI10.1016/S1571-0661(04)00311-1zbMath1268.68129MaRDI QIDQ2841265

Stéphane Lafrance, John Mullins

Publication date: 24 July 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Controlling information release in the \(\pi\)-calculus ⋮ \textit{D\_PSNI}: delimited persistent stochastic non-interference ⋮ On Intransitive Non-interference in Some Models of Concurrency

Cites Work

• Decidability of bisimulation equivalence for normed pushdown processes
• Decidability of DPDA equivalence
• Reasoning about cryptographic protocols in the spi calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols