From One Session to Many: Dynamic Tags for Security Protocols

DOI10.1007/978-3-540-89439-1_9zbMATH Open1182.68082OpenAlexW2157278388MaRDI QIDQ5505548FDOQ5505548

Authors: Myrto Arapinis, Stéphanie Delaune, Steve Kremer 

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_9

Recommendations

• Dynamic tags for security protocols
• Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
• Computer Science Logic
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• A (restricted) quantifier elimination for security protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)

Cited In (11)

• Bounded memory protocols
• Computer Science Logic
• A (restricted) quantifier elimination for security protocols
• Safely composing security protocols
• Sessions and separability in security protocols
• Bounded memory Dolev-Yao adversaries in collaborative systems
• Dynamic tags for security protocols
• Challenges in the Automated Verification of Security Protocols
• Modular verification of protocol equivalence in the presence of randomness
• Composition of password-based protocols
• The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols

Uses Software

• AVISPA

This page was built for publication: From One Session to Many: Dynamic Tags for Security Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505548)