Pages that link to "Item:Q437043"
From MaRDI portal
The following pages link to Decidability and combination results for two notions of knowledge in security protocols (Q437043):
Displaying 12 items.
- Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories (Q3498466) (← 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)
- Automata, Languages and Programming (Q5466517) (← links)