scientific article; zbMATH DE number 4053510
From MaRDI portal
Publication:3789477
Recommendations
- scientific article; zbMATH DE number 3965967
- On the reachability problem in cryptographic protocols
- On the decidability of cryptographic protocols with open-ended data structures
- A symbolic decision procedure for cryptographic protocols with time stamps (extended abstract)
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
Cited in
(7)- Deciding the security of protocols with commuting public key encryption
- Satisfiability of Dolev-Yao constraints
- Intractable problems in cryptography
- Secrecy for security protocols
- Combining Algorithms for Deciding Knowledge in Security Protocols
- A symbolic decision procedure for cryptographic protocols with time stamps (extended abstract)
- Deciding cryptographic protocol adequacy with HOL: the implementation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789477)