Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables

DOI10.1007/978-3-642-02002-5_1zbMath1242.94015OpenAlexW2133030362MaRDI QIDQ3631368

Hubert Comon-Lundh, Reynald Affeldt

Publication date: 9 June 2009

Published in: Formal to Practical Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02002-5_1

Mathematics Subject Classification ID

Related Items (3)

Challenges in the Automated Verification of Security Protocols ⋮ Rigid tree automata and applications ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An NP decision procedure for protocol insecurity with XOR
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Security properties: two agents are sufficient
• Deciding security properties for cryptographic protocols. application to key cycles
• Protocol Verification Via Rigid/Flexible Resolution
• Theorem Proving via General Matings
• Programming Languages and Systems

This page was built for publication: Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables