Slides and presentations

Keynotes Speakers

Accepted Presentations

•  Baelde David, Fontaine Caroline, Koutsos Adrien, Scerri Guillaume, Vignon Théo
  A Probabilistic Logic for Concrete Security
  
  
• Arapinis Myrto, Racouchot Maïwenn, Robin David, Zacharias Thomas
  A UC analysis of Android Protected Confirmation
  
  
• Mahmoud Dhekra, Lafourcade Pascal , Ruhault Sylvain
  A Unified Symbolic Analysis of WireGuard
  
  
• Lacombe Guilhem, Bardin Sébastien
  Attacker Control and Bug Prioritization
  
  
• Menguy Grégoire
  Black-box Precondition Inference through Constraint Acquisition
  
  
• Recoules Frédéric
  Boosting the BINSEC symbolic execution engine: A France CyberSecurity Challenge journey
  
  
• Cheval Vincent, Cortier Véronique, Debant Alexandre
  Election Verifiability with ProVerif
  
  
• Geimer Antoine, Vergnolle Mathéo, Recoules Frédéric, Daniel Lesly-Ann, Bardin Sébastien, Maurice Clémentine
  Systematic Evaluation of Automated Tools for Side-Channel Vulnerability Detection in Cryptographic Libraries
  
  
• Delaune Stéphanie, Lallemand Joseph, Patat Gwendal, Roudot Florian, Sabt Mohamed
  Formal analysis of WideVine DRM in Tamarin
  
  
• Prévost Thomas, Alibart Olivier, Martin Bruno
  Formal verification of the ETSI proposal on a standard QKD protocol
  

• Louistisserand Léo, Jeanteur Simon, Maffei Matteo
  Formal verification of the Lightning Network protocol
  
  
• Wilke Pierre
  Formalizing Hardware Security Mechanisms Using SMT Solvers
  
  
• Sellami Yanis, Girol Guillaume, Recoules Frédéric, Couroussé Damien, Bardin Sébastien
  Inference of Robust Reachability Constraints
  
  
• Davoli Davide
  On Kernel Safety and Speculative Execution
  
  
• Sardar Muhammad Usama, Niemi Arto, Hannes Tschofenig, Thomas Fossati
  Towards formal verification of attested TLS: Potential replay attacks on RA-TLS
  
  
• Simonnet Julien, Lemerre Matthieu, Sighireanu Mihaela
  Precise and efficient memory analysis for low level languages
  
  
• Florian Moser
  ProVerif Proofs over an Internet Voting System using Short Voting Codes
  
  
• Catinaud Margot, Fontaine Caroline, Scerri Guillaume
  Proving e-voting mixnets in the CCSA model: zero-knowledge proofs and rewinding
  
  
• Tollec Simon, Hadžić Vedad, Nasahl Pascal, Asavoae Mihail, Bloem Roderick, Couroussé Damien, Heydemann Karine, Jan Mathieu, Mangard Stefan
  Proving Hardware Security of CPUs to Analyze Software Resistance against Faults Attacks
  
  
• Delaune Stéphanie, Hérouard Clément, Lallemand Joseph
  Secrecy by typing in the computational model
  
  
• Mahe Erwan
  Simulation multi-agent d'attaques sur protocoles distribués
  
  
• Claverie Tristan
  Towards Nonce-misuse Resistant Protocols
  
  
• Riou Stanislas, Baelde David, Delaune Stéphanie
  Verification of security protocols: using SMT solvers in the Squirrel prover
  
  
• Parolini Francesco, Miné Antoine
  Sound Abstract Nonexploitability Analysis
  
  
• Cheval Vincent, Fontaine Caroline
  Automatic verification of Finite Variant Property Beyond Convergent Equational Theories