Deciding Key Cycles for Security Protocols
From MaRDI portal
Recommendations
- Deciding security properties for cryptographic protocols. application to key cycles
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- A symbolic decision procedure for cryptographic protocols with time stamps (extended abstract)
- STACS 2004
- On the reachability problem in cryptographic protocols
Cited in
(9)- Safely composing security protocols
- Deciding the security of protocols with commuting public key encryption
- Deciding security properties for cryptographic protocols. application to key cycles
- Verifying Cryptographic Protocols with Subterms Constraints
- Bounding messages for free in security protocols -- extension to various security properties
- A survey of symbolic methods in computational analysis of cryptographic systems
- Safely Composing Security Protocols
- Bounding Messages for Free in Security Protocols
- Circular insecure encryption: from long cycles to short cycles
This page was built for publication: Deciding Key Cycles for Security Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387901)