Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An NP Decision Procedure for Protocol Insecurity with XOR
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A Tool for Lazy Verification of Security Protocols
Proceedings of the 16th IEEE international conference on Automated software engineering
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
Chosen-name Attacks: An Overlooked Class of Type-flaw Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 15th ACM conference on Computer and communications security
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Optimistic non-repudiation protocol analysis
WISTP'07 Proceedings of the 1st IFIP TC6 /WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems
Automatic analysis of the security of XOR-based key management schemes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A symbolic intruder model for hash-collision attacks
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Secure multicast in IPTV services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Formal modelling and automatic detection of resource exhaustion attacks
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Towards formal validation of trust and security in the internet of services
The future internet
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Tunneled TLS for multi-factor authentication
Proceedings of the 11th annual ACM workshop on Digital rights management
Automated verification of virtualized infrastructures
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Protocol analysis modulo combination of theories: a case study in Maude-NPA
STM'10 Proceedings of the 6th international conference on Security and trust management
SeVe: automatic tool for verification of security protocols
Frontiers of Computer Science in China
Comparison of cryptographic verification tools dealing with algebraic properties
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Orchestration under security constraints
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Customizing protocol specifications for detecting resource exhaustion and guessing attacks
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Formal analysis of CWA 14890-1
CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Formal verification of a key establishment protocol for EPC gen2 RFID systems: work in progress
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Web services verification and prudent implementation
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
Distributed orchestration of web services under security constraints
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Diffie-Hellman without difficulty
FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
Towards the orchestration of secured services under non-disclosure policies
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
Timed protocol insecurity problem is NP-complete
Future Generation Computer Systems
YAPA: A Generic Tool for Computing Intruder Knowledge
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper presents an overview of the CL-Atse tool, an efficient and versatile automatic analyser for the security of cryptographic protocols. CL-Atse takes as input a protocol specified as a set of rewriting rules (IF format, produced by the AVISPA compiler), and uses rewriting and constraint solving techniques to model all reachable states of the participants and decide if an attack exists w.r.t. the Dolev-Yao intruder. Any state-based security property can be modelled (like secrecy, authentication, fairness, etc...), and the algebraic properties of operators like xor or exponentiation are taken into account with much less limitations than other tools, thanks to a complete modular unification algorithm. Also, useful constraints like typing, inequalities, or shared sets of knowledge (with set operations like removes, negative tests, etc...) can also be analysed.