The following pages link to (Q4536407):
Displaying 19 items.
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Multi-attacker protocol validation (Q540676) (← links)
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
- Weakening the perfect encryption assumption in Dolev-Yao adversaries (Q557896) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Safely composing security protocols (Q1028731) (← links)
- On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
- Private authentication (Q1881255) (← links)
- Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
- Moving the bar on computationally sound exclusive-or (Q2148759) (← links)
- Formalizing provable anonymity in Isabelle/HOL (Q2355379) (← links)
- Automated analysis of cryptographic assumptions in generic group models (Q2423840) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions (Q2866733) (← links)
- Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies (Q5009424) (← links)
