Pages that link to "Item:Q5191113"
From MaRDI portal
The following pages link to Computing Knowledge in Security Protocols under Convergent Equational Theories (Q5191113):
Displaying 12 items.
- Reducing equational theories for the decision of static equivalence (Q437026) (← links)
- Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties (Q3184784) (← links)
- Combining Algorithms for Deciding Knowledge in Security Protocols (Q3525004) (← links)
- (Q4517291) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- Automata, Languages and Programming (Q5466517) (← links)