Accepted Papers

Each talk must be 20 minutes long. 

Here is the list of accepted papers:

• Formally Verified Hardening of C Programs against Hardware Fault Injection, Basile Pesin (Ecole Nationale de l'Aviation Civile), Sylvain Boulmé (Université Grenoble Alpes), David Monniaux (Université Grenoble Alpes), Marie-Laure Potet (Université Grenoble Alpes)
  
  
• Vote&Check: Secure Postal Voting with Reduced Trust Assumptions, Véronique Cortier (Université de Lorraine, CNRS, Inria, LORIA), Alexandre Debant (Université de Lorraine, CNRS, Inria, LORIA), Pierrick Gaudry (Université de Lorraine, CNRS, Inria, LORIA), Léo Louistisserand (Université de Lorraine, CNRS, Inria, LORIA)
  
  
• Automated Discovery of Subtle Attacks on Protocols using Mix-Nets, Jannik Dreier (Université de Lorraine),Pascal Lafourcade (Université Clermont-Auvergne), Dhekra Mahmoud (Université Clermont-Auvergne)
  
  
• Equational theories with user defined AC function symbols in Tamarin, Elise Klein (Université de Lorraine), Jannik Dreier (Université de Lorraine), Steve Kremer (Inria Université de Lorraine)
  
  
• Stratégies optimales de défense active basées sur la vérification formelle de systèmes multi-agent, Gabriel Ballot (Télécom Paris - EDF R&D)
  
  
• A Scalable Framework for Backward Bounded Static Symbolic Execution, Nicolas Bellec (CEA-LIST), Grégoire Menguy (CEA-LIST), Frederic Recoules (CEA-LIST), Sébastien Bardin (CEA-LIST)
  
  
• The Attack Tree Synthesis Problem through Formula Synthesis, Sophie Pinchinat (IRISA/Université de Rennes)
  
  
• Augmenting Search-based Program Synthesis with Local Inference Rules to Improve Blackbox Deobfuscation, Vidal Attias (CEA-LIST), Gregoire Menguy (CEA-LIST), Sébastien Bardin (CEA-LIST)
  
  
• Design and Usage of a Modular Implementation for Relational Analyses in Binsec: Constant Time and Secret Erasure, Yanis Sellami (CEA, List), Frédéric Recoules (CEA, List), Sébastien Bardin (CEA, List)
  
  
• Quantitative Robustness for Vulnerability Assessment, Guilhem Lacombe (CEA LIST, Université Paris-Saclay), Sébastien Bardin (CEA LIST, Université Paris-Saclay)
  
  
• Non-deduction proofs in Squirrel and the security of Signal, Clément Hérouard (Univ. Rennes, CNRS, IRISA), Charlie Jacomme (Université de Lorraine, CNRS, Inria, LORIA), Adrien Koutsos (INRIA Paris), Joseph Lallemand (Univ. Rennes, CNRS, IRISA)
  
  
• New Formalisation & Attack-finding for Session Unlinkability, Ioana Cristina Boureanu (Surrey Centre for Cyber Security, University of Surrey), Fortunat Rajaona (Surrey Centre for Cyber Security, University of Surrey)
  
  
• Formalizing trust in Cyber Threat Intelligence, Mariam Wehbe (INSA CVL), Laurent Bobelin (INSA CVL), Sabine Frittella (INSA CVL)
  
  
• Differential DY fuzzing : Adding differential fuzzing to the Puffin fuzzer, Tom Gouville (Inria Nancy)
  
  
• NetArch: Combining Network-Protocol and Architectural Specifications of Attestation Frameworks for Confidential Computing, Muhammad Usama Sardar (TU Dresden)
  
  
• Formal verification of security properties of 5G slices : an elementary use case, Ahmed Bouabdallah (IMT Atlantique)
  
  
• Termination Resilience Static Analysis, Naïm MOUSSAOUI REMIL (ENS PSL | Inria Paris), Urban (ENS PSL | Inria Paris)