Pages that link to "Item:Q2849571"
From MaRDI portal
The following pages link to Analysing password protocol security against off-line dictionary attacks (Q2849571):
Displaying 17 items.
- Reducing equational theories for the decision of static equivalence (Q437026) (← links)
- Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- On the implications of Zipf's law in passwords (Q2165466) (← links)
- Composition of password-based protocols (Q2248082) (← links)
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106) (← links)
- Automated verification of selected equivalences for security protocols (Q2474047) (← links)
- Off-line password-guessing attacks on the generalized key agreement and password authentication protocol (Q2572355) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- A Calculus to Detect Guessing Attacks (Q3399200) (← links)
- YAPA: A Generic Tool for Computing Intruder Knowledge (Q3636824) (← links)
- Analysing privacy-type properties in cryptographic protocols (invited talk) (Q4993330) (← links)
- Computing Knowledge in Security Protocols under Convergent Equational Theories (Q5191113) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705935) (← links)
- Automata, Languages and Programming (Q5716817) (← links)
- Automating Security Analysis: Symbolic Equivalence of Constraint Systems (Q5747780) (← links)
