Safely Composing Security Protocols

DOI10.1007/978-3-540-77050-3_29zbMath1135.68392OpenAlexW1681146363MaRDI QIDQ5458848

Stéphanie Delaune, Jérémie Delaitre, Véronique Cortier

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_29

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items

Modular verification of protocol equivalence in the presence of randomness ⋮ Challenges in the Automated Verification of Security Protocols ⋮ Bounding messages for free in security protocols -- extension to various security properties ⋮ Composition of password-based protocols ⋮ Cryptographic Protocol Composition via the Authentication Tests ⋮ Safely Composing Security Protocols ⋮ Bounding Messages for Free in Security Protocols ⋮ Safely composing security protocols

Uses Software

• AVISPA

Cites Work

• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Security properties: two agents are sufficient
• Protocol Composition Logic (PCL)
• Using encryption for authentication in large networks of computers
• Deciding Key Cycles for Security Protocols
• Safely Composing Security Protocols
• Logic for Programming, Artificial Intelligence, and Reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item