Combining Algorithms for Deciding Knowledge in Security Protocols
From MaRDI portal
Recommendations
- Decidability and combination results for two notions of knowledge in security protocols
- Automata, Languages and Programming
- Deciding knowledge in security protocols under equational theories
- Computing knowledge in security protocols under convergent equational theories
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Deciding knowledge in security protocols under some e-voting theories
- Information based reasoning about security protocols
- scientific article; zbMATH DE number 4053510
- scientific article; zbMATH DE number 2163007
Cited in
(13)- Notions of knowledge in combinations of theories sharing constructors
- Deciding knowledge in security protocols under some e-voting theories
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories
- Challenges in the Automated Verification of Security Protocols
- Reducing equational theories for the decision of static equivalence
- Computing knowledge in security protocols under convergent equational theories
- Decidability and combination results for two notions of knowledge in security protocols
- scientific article; zbMATH DE number 1534512 (Why is no real title available?)
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Automated verification of equivalence properties of cryptographic protocols
- A Proof Theoretic Analysis of Intruder Theories
- Deciding knowledge in security protocols under equational theories
- Compiling and securing cryptographic protocols
This page was built for publication: Combining Algorithms for Deciding Knowledge in Security Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525004)