Date: May 13, 2026Place: A008Chairs: Charlie Jacomme and Engel Lefaucheaux Tentative Schedule 10h00-12h: 12h00: pizzas in “salle club” (the room between the restaurant and the cafeteria) 13h00: coffee 13h30-15h35: Detailed program Colin Blake: Equational Reasoning for Qudit Circuits Abstract: Quantum programs are most often represented as quantum circuits: sequences of…
Date: May 6, 2025Place: A008Chairs: Charlie Jacomme and Engel Lefaucheaux Each presentation will last a total of maximum 30 minutes (20 minutes talks + 10 minutes of question/setting up). We encourage all talks to be given in English. Tentative schedule 9h30 – 10h30: Florian Moser, Joannes Guichon 10h30 – 10h45:…
Date: June 17, 2022 Place: Alice and Bob (B11-B13) Chair: Emmanuel Jeandel 9h30-10h00 Welcome 10h00-10h30 Dylan Marinho Guaranteeing Timed Opacity using Parametric Timed Model Checking Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage occurs whenever an attacker successfully deduces confidential internal…
Date: November 19, 2019 Place: Alice and Bob (B11-B13) Chairs: Emmanuel Jeandel 9h15-9h30 Welcome Session 1 : 9h30-10h30 Pierre Lermusiaux Pattern Eliminating Transformation #T1 Program transformation is a common practice in computer science, and its many applications can have a range of different objectives. For example, a program written in…
Date: November 20, 2018 Place: A008 Chairs: Emmanuel Jeandel 9h15-9h30 Welcome Session 1 : 9h30-10h30 Joseph Lallemand Voting: You Can’t Have Privacy without Individual Verifiability #T5 Electronic voting typically aims at two main security goals: vote privacy and verifiability. These two goals are often seen as antagonistic and some national…
Date: November 7 Place: A008 Chairs: Emmanuel Jeandel 09h00 – 09h30 Welcome 09h30 – 10h00 : Joseph Lallemand A Type System for Privacy Properties Mature push button tools have emerged for checking trace properties (e.g. secrecy or authentication) of security protocols. The case of indistinguishability-based privacy properties (e.g. ballot privacy…
Date: October 16 Place: A008 Chairs: Emmanuel Jeandel Session 1 : 8h30-10h 8h30-9h00 : Hubert Godfroy A theory of reflexive computation based on soft intuitionistic logic Computational Reflection is a paradigm in which the computational mechanisms controls the different levels of data interpretation. It can be decomposed into two processes:…
Date: October 20 Place: A008 Chairs: Emmanuel Jeandel Session 1 : 9h-10h Eric Le Morvan Secure refinements of communication channels It is a common practice when designing security protocols to assume that they already unspecified secure channels. Then the secure channels are implemented using any standard protocol, e.g. TLS. However…
Date: Tuesday, October 14 Place: B013 Chairs: Emmanuel Jeandel 14h00-14h35 : Hubert Godfroy (Carte) Self Modifying Machines We describe a new framework for self-modifying programs. Our goal is to show how to extract program abstraction focusing on self-modifications. On the first hand, we use a abstract machine which makes explicit…
Date: Tuesday, October 22 Place: A008 Chair: Michael Rusinowitch (morning) & Emmanuel Jeandel (afternoon) 9h30-10h : Jean-Christophe Bach (Pareo) Langage et outil pour la transformation de modèles 10h-10h30 : Houari Mahfoud (Cassis) Secure and Valid Manipulation of XML Data It is increasingly common to find XML views used to enforce…