Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
DOI10.1007/978-3-642-02002-5_1zbMATH Open1242.94015OpenAlexW2133030362MaRDI QIDQ3631368FDOQ3631368
Authors: Reynald Affeldt, Hubert Comon-Lundh 
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
Recommendations
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- scientific article; zbMATH DE number 7559487
- scientific article; zbMATH DE number 1948405
- scientific article; zbMATH DE number 7650814
- scientific article; zbMATH DE number 7297874
- Protocol Verification Via Rigid/Flexible Resolution
- Constraint Abstraction in Verification of Security Protocols
- A coordination-based methodology for security protocol verification
Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Resolution theorem proving
- Resolution decision procedures
- Title not available (Why is that?)
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- An NP decision procedure for protocol insecurity with XOR
- Deciding security properties for cryptographic protocols. application to key cycles
- Title not available (Why is that?)
- Programming Languages and Systems
- Security properties: two agents are sufficient
- Protocol Verification Via Rigid/Flexible Resolution
- Theorem Proving via General Matings
Cited In (6)
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
- A (restricted) quantifier elimination for security protocols
- Challenges in the Automated Verification of Security Protocols
- Automated verification of equivalence properties of cryptographic protocols
- Rigid tree automata and applications
- Protocol Verification Via Rigid/Flexible Resolution
This page was built for publication: Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631368)
