Bounding Messages for Free in Security Protocols

DOI10.1007/978-3-540-77050-3_31zbMath1135.68389MaRDI QIDQ5458850

Myrto Arapinis, Marie Duflot

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_31

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

94A62: Authentication, digital signatures and secret sharing

Related Items

Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif, Bounding Messages for Free in Security Protocols, Bounded memory Dolev-Yao adversaries in collaborative systems, Bounding messages for free in security protocols -- extension to various security properties, Satisfiability of general intruder constraints with and without a set constructor, Safely composing security protocols, Composition of password-based protocols

Cites Work

• Unnamed Item
• Verification of cryptographic protocols: tagging enforces termination
• Tree automata with one memory set constraints and cryptographic protocols
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Computer Science Logic
• Deciding Key Cycles for Security Protocols
• Safely Composing Security Protocols
• Bounding Messages for Free in Security Protocols