Pages that link to "Item:Q2482449"
From MaRDI portal
The following pages link to Symbolic protocol analysis for monoidal equational theories (Q2482449):
Displaying 7 items.
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- Deducibility constraints and blind signatures (Q462488) (← links)
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories (Q3498466) (← links)
- Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (Q3636823) (← links)
- A Proof Theoretic Analysis of Intruder Theories (Q5902125) (← links)
