Pages that link to "Item:Q6044108"
From MaRDI portal
The following pages link to Reasoning about cryptographic protocols in the spi calculus (Q6044108):
Displaying 13 items.
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- Primitives for authentication in process algebras. (Q1603653) (← links)
- A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
- A comparison of three authentication properties. (Q1853750) (← links)
- Joshua Guttman: pioneering strand spaces (Q2154021) (← links)
- A static analysis of cryptographic processes: the denotational approach (Q2484412) (← links)
- Simulation and analysis of cryptographic protocols (Q2765456) (← links)
- Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols (Q2841265) (← links)
- A denotational approach to the static analysis of cryptographic processes (Q2849549) (← links)
- Implementing Spi Calculus Using Nominal Techniques (Q3507444) (← links)
- Security, Cryptography and Directed Bigraphs (Q3540426) (← links)
- Recovering the tight security proof of SPHINCS\textsuperscript{+} (Q6133961) (← links)