-
Handling Algebraic Properties in Automatic Analysis of Security Protocols
This paper extends the approximation-based theoretical framework in which the security problem secrecy preservation against an intruder may be semi-decided through a... -
Automatic Verification of Security Protocols Using Approximations
Security protocols are widely used in open modern networks to ensure safe communications. It is now recognized that formal analysis can provide the level of assurance... -
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of... -
A Simple Constraint-solving Decision Procedure for Protocols with Exclusive or
We present a procedure for deciding security of protocols employing the Exclusive or operator. This procedure relies on a direct combination of a constraint solver for... -
Formal verification of security protocol implementations: a survey
International audience -
A BSP algorithm for on-the-fly checking LTL formulas on security protocols
International audience -
Formal modelling and analysis of behaviour grading within a peer-to-peer stor...
International audience -
The STAC (Security Toolbox: Attacks & Countermeasures) ontology
International audience -
A BSP algorithm for on-the-fly checking CTL* formulas on security protocols
International audience -
Fairness in Certified Electronic Mail
International audience -
Ontology and protocol secure for SCADA
International audience -
A Simple Constraint-solving Decision Procedure for Protocols with Exclusive or
Colloque avec actes et comité de lecture. internationale. -
Deciding knowledge in security protocols under equational theories
National audience
