Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
The AVISS Security Protocol Analysis Tool
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
How to Prevent Type Flaw Attacks on Security Protocols
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
On the security of multi-party ping-pong protocols
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
New directions in cryptography
IEEE Transactions on Information Theory
On the security of public key protocols
IEEE Transactions on Information Theory
Modelling and Checking Timed Authentication of Security Protocols
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
LDYIS: a Framework for Model Checking Security Protocols
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Validating Integrity for the Ephemerizer's Protocol with CL-Atse
Formal to Practical Security
Comparing State Spaces in Automatic Security Protocol Analysis
Formal to Practical Security
Automated Security Protocol Analysis With the AVISPA Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximation-based tree regular model-checking
Nordic Journal of Computing
Is your security protocol on time?
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Comparison of cryptographic verification tools dealing with algebraic properties
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Model driven security analysis of IDaaS protocols
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
LDYIS: a Framework for Model Checking Security Protocols
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Modelling and Checking Timed Authentication of Security Protocols
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
A belief logic for analyzing security of web protocols
TRUST'12 Proceedings of the 5th international conference on Trust and Trustworthy Computing
Managing trust and secrecy in identity management clouds
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Using automated model analysis for reasoning about security of web protocols
Proceedings of the 28th Annual Computer Security Applications Conference
| Hi-index | 0.00 |
In previous work we showed that automatic SAT-based model-checking techniques based on a reduction of protocol (in)security problems to a sequence of propositional satisfiability problems can be used to effectively find attacks on protocols. In this paper we present an optimized intruder model that may lead in many cases to shorter attacks which can be detected in our framework by generating smaller propositional formulae. The key idea is to assume that some of the abilities of the intruder have instantaneous effect, whereas in the previously adopted approach all the abilities of the intruder were modeled as state transitions. This required non trivial extensions to the SAT-reduction techniques which are formally described in the paper. Experimental results indicate the advantages of the proposed optimization.