Discovering ePassport vulnerabilities using bisimilarity
From MaRDI portal
Recommendations
- Analysing privacy-type properties in cryptographic protocols (invited talk)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- scientific article; zbMATH DE number 1507234
- scientific article; zbMATH DE number 1251177
- Stand-by attacks on E-ID password authentication
Cites work
- A calculus for cryptographic protocols: The spi calculus
- A characterisation of open bisimilarity using an intuitionistic modal logic
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
- A complete symbolic bisimulation for full applied pi calculus
- A proof theoretic analysis of intruder theories
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- Characterising Testing Preorders for Finite Probabilistic Processes
- Expressiveness modulo bisimilarity of regular expressions with parallel composition
- Failure trace semantics for a process algebra with time-outs
- scientific article; zbMATH DE number 1231679 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- Injective synchronisation: An extension of the authentication hierarchy
- Modal logics for mobile processes
- On a new formal proof model for RFID location privacy
- Open bisimulation, revisited
- Outline of a Theory of Truth
- Quasi-open bisimilarity with mismatch is intuitionistic
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
- Real time process algebra
- Reconciling real and stochastic time: the need for probabilistic refinement
- Security Analysis of the PACE Key-Agreement Protocol
- SPEC: an equivalence checker for security protocols
- Supplemental access control (PACE v2): security analysis of PACE integrated mapping
- Symbolic bisimulations
- The Applied Pi Calculus
- The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
Cited in
(10)- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
- A characterisation of open bisimilarity using an intuitionistic modal logic
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus
- Process equivalence problems as energy games
- Relational connectors and heterogeneous simulations
- Independence and causality in the reversible concurrent setting
- One energy game for the spectrum between branching bisimilarity and weak trace semantics
- Modal logics for mobile processes revisited
- Open bisimilarity for the -calculus with mismatch
This page was built for publication: Discovering ePassport vulnerabilities using bisimilarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009710)
