Automatic SAT-compilation of protocol insecurity problems via reduction to planning

DOI10.1007/3-540-36135-9_14MaRDI QIDQ4422080zbMATH OpenFDO

Authors Alessandro Armando, Luca Compagna

Publication date 3 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2529/25290210.htm

zbMATH Keywords

Network securityVerification

Mathematics Subject Classification ID

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

Recommendations

• Logics in Artificial Intelligence
• Theory and Applications of Satisfiability Testing
• An optimized intruder model for SAT-based model-checking of security protocols
• Compiling and verifying security protocols
• SAT-Based Verification of Security Protocols Via Translation to Networks of Automata

Cited in

(9)

• Compiling and verifying security protocols
• An optimized intruder model for SAT-based model-checking of security protocols
• Verifying Cryptographic Protocols with Subterms Constraints
• Theory and Applications of Satisfiability Testing
• Logics in Artificial Intelligence
• SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
• Key Substitution in the Symbolic Analysis of Cryptographic Protocols
• An integrative framework to protocol analysis and repair: Bellare-Rogaway model + planning + model checker
• Verifying security protocols as planning in logic programming

Describes a project that uses

Uses Software

• SATO
• Casper
• TAPS
• Chaff

This page was built for publication: Automatic SAT-compilation of protocol insecurity problems via reduction to planning

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