Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning [chapter]

Alessandro Armando, Luca Compagna
2002 Lecture Notes in Computer Science  
We provide a fully automatic translation from security protocol specifications into propositional logic which can be effectively used to find attacks to protocols. Our approach results from the combination of a reduction of protocol insecurity problems to planning problems and well-known SAT-reduction techniques developed for planning. We also propose and discuss a set of transformations on protocol insecurity problems whose application has a dramatic effect on the size of the propositional
more » ... ding obtained with our SAT-compilation technique. We describe a model-checker for security protocols based on our ideas and show that attacks to a set of well-known authentication protocols are quickly found by state-of-the-art SAT solvers.
doi:10.1007/3-540-36135-9_14 fatcat:6uh5hj4ufbaetexxkn3dlt22yi