Safely Composing Security Protocols
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1149905 (Why is no real title available?)
- scientific article; zbMATH DE number 1956510 (Why is no real title available?)
- scientific article; zbMATH DE number 1962757 (Why is no real title available?)
- scientific article; zbMATH DE number 1927582 (Why is no real title available?)
- Deciding Key Cycles for Security Protocols
- Logic for Programming, Artificial Intelligence, and Reasoning
- Protocol composition logic (PCL)
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Safely Composing Security Protocols
- Security properties: two agents are sufficient
- Using encryption for authentication in large networks of computers
Cited in
(13)- Secure protocol composition
- Secure composition of protocols
- Compositional refinement in agent-based security protocols
- Safely composing security protocols
- Sessions and separability in security protocols
- Bounding Messages for Free in Security Protocols
- Challenges in the Automated Verification of Security Protocols
- Bounding messages for free in security protocols -- extension to various security properties
- Modular verification of protocol equivalence in the presence of randomness
- Safely Composing Security Protocols
- Composition of password-based protocols
- Transforming password protocols to compose
- Cryptographic Protocol Composition via the Authentication Tests
This page was built for publication: Safely Composing Security Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458848)