The following pages link to Private authentication (Q1881255):
Displaying 14 items.
- Deciding equivalence-based properties using constraint solving (Q391121) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Theorem-proving anonymity of infinite-state systems (Q845891) (← links)
- A complete symbolic bisimulation for full applied pi calculus (Q1758155) (← links)
- A procedure for deciding symbolic equivalence between sets of constraint systems (Q2013557) (← links)
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity (Q2119978) (← links)
- POR for security protocol equivalences. Beyond action-determinism (Q2167736) (← links)
- Stateful applied pi calculus: observational equivalence and labelled bisimilarity (Q2397042) (← links)
- On Communication Models When Verifying Equivalence Properties (Q3304813) (← links)
- Channel abstractions for network security (Q3550700) (← links)
- Security Abstractions and Intruder Models (Extended Abstract) (Q5170668) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- A semantics for web services authentication (Q5892652) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
