Student sessions

 

Each student session comprises 3 short talks (10 min + questions) followed by a poster session. Sessions are scheduled from 4pm to 5pm, yet the poster room will stay open later for discussions. Short videos will also be available any time during the school.

 

Student session I (Monday)

    talks

  • Lesly-Ann Daniel: Efficient Relational Symbolic Execution for Speculative Constant-Time at Binary-Level
  • Dylan Marinho: Guaranteeing Timed Opacity using Parametric Timed Model Checking
  • Florian Vanhems: Designing a control flow transfer service in a formally proven kernel

    posters

  • Dylan Marinho: Guaranteeing Timed Opacity using Parametric Timed Model Checking   
  • Lesly-Ann Daniel: Efficient Relational Symbolic Execution for Speculative Constant-Time at Binary-Level
  • Jonathan Certes: Formally verified remote attestation for microprocessors
  • Nan Messe: An asset-based approach to bridge the gap between architects and security experts

 

Student session II (Tuesday)

    talks

  • Roberto Blanco: Perspectives on practical secure compilation
  • Gregoire Menguy: AI-based blackbox deobfuscation
  • Solene Mirliaz: Provable Cost Analysis of Cryptographic Code

   posters  

  • Solene Moreau: A method for proving unlinkability of stateful protocols
  • Yuxiao Mao: Reconfigurable Hardware for Microarchitectural Timing Attacks
  • Yi Liu: Linear Programming Bounds on the Kissing Number of Binary Codes
  • Salim Yahia Kissi: Detection of security vulnerabilities caused by safety bugs

 

 Short videos (anytime)

  • Nan Messe -- An asset-based approach to bridge the gap between architects and security experts
  • Solene Moreau -- A method for proving unlinkability of stateful protocols
  • Yuxiao Mao -- Reconfigurable Hardware for Microarchitectural Timing Attacks
  • Grégoire Menguy -- Blackbox deobfuscation in a nutshell
  • Guillaume Girol -- Getting rid of a class of false positives in symbolic execution
  • Salim Yahia Kissi -- Detection of security vulnerabilities caused by safety bugs
  • Solène Mirliaz -- Provable Cost Analysis of Cryptographic Code 
  • Jonathan Certes -- Formally verified remote attestation for microprocessors
  • Florian Vanhems -- Designing a control flow transfer service in a formally proven kernel 

 

Online user: 1