Pages that link to "Item:Q437033"
From MaRDI portal
The following pages link to Computing knowledge in security protocols under convergent equational theories (Q437033):
Displaying 14 items.
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Probability timed automata for investigating communication processes (Q747506) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Terminating non-disjoint combined unification (Q2119106) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- Combining Algorithms for Deciding Knowledge in Security Protocols (Q3525004) (← links)
- (Q4517291) (← links)
- Analysing privacy-type properties in cryptographic protocols (invited talk) (Q4993330) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Computing Knowledge in Security Protocols under Convergent Equational Theories (Q5191113) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- Automata, Languages and Programming (Q5466517) (← links)
- DeepSec: deciding equivalence properties for security protocols -- improved theory and practice (Q6566464) (← links)
