Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols

DOI10.1016/S1571-0661(04)00311-1MaRDI QIDQ2841265zbMATH OpenFDO

Authors Stéphane Lafrance, John Mullins

Publication date 24 July 2013

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

Full work available at URL https://doi.org/10.1016/S1571-0661(04)00311-1

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1251177
• scientific article; zbMATH DE number 1670837
• scientific article; zbMATH DE number 1497862
• Context-sensitive equivalences for non-interference based protocol analysis.
• Information and Communications Security

Cites work

• Decidability of bisimulation equivalence for normed pushdown processes
• Decidability of DPDA equivalence
• scientific article; zbMATH DE number 3926231 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1251177 (Why is no real title available?)
• scientific article; zbMATH DE number 588035 (Why is no real title available?)
• scientific article; zbMATH DE number 1739897 (Why is no real title available?)
• scientific article; zbMATH DE number 1487487 (Why is no real title available?)
• scientific article; zbMATH DE number 1497862 (Why is no real title available?)
• scientific article; zbMATH DE number 1834562 (Why is no real title available?)
• Nondeterministic admissible interference
• Reasoning about cryptographic protocols in the spi calculus

Cited in

(8)

• \textit{D\_PSNI}: delimited persistent stochastic non-interference
• System-level non-interference of constant-time cryptography. I: Model
• Controlling information release in the \(\pi\)-calculus
• On intransitive non-interference in some models of concurrency
• scientific article; zbMATH DE number 1251177 (Why is no real title available?)
• Information and Communications Security
• Context-sensitive equivalences for non-interference based protocol analysis.
• Branching bisimulation semantics enables noninterference analysis of reversible systems

This page was built for publication: Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols

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