BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:b3ed4abe-c3c1-4e51-b4c4-254fd2a399f9
X-WR-CALNAME:[MTV] Dylan Marinho (LORIA) - Ensuring opacity in timed system
 s
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20250330T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:b3ed4abe-c3c1-4e51-b4c4-254fd2a399f9
DTSTAMP:20260430T043903Z
CLASS:PUBLIC
DESCRIPTION:Information leakage can have dramatic consequences on the secur
 ity of complex timed systems.\nAmong harmful information leaks\, the timin
 g information leakage is the ability for an attacker to deduce internal in
 formation depending on timing information.\nFirst\, We propose a definitio
 n of timed opacity w.r.t. execution time\, where a system is opaque whenev
 er the attacker is unable to deduce the reachability of some private state
  solely based on the execution time. We also extend this definition to a n
 otion of expiring opacity\, where the secrecy is violated only when the pr
 ivate state was entered ''recently''\, ie. within a given time bound (or e
 xpiration date) prior to system completion.\nWe study here execution-time 
 opacity problems (with or without expiring secrecy) in timed automata. The
 n\, we study the decidability of several parameterized problems\, when som
 e internal timing constants become timing parameters of unknown constant v
 alues.\nWe finally address the control of timed systems to avoid timing le
 aks. We focus on the exhibition of a controller\, ie. a set of allowed act
 ions\, such that the system restricted to those actions is execution-time 
 opaque for all its execution times.\nWe first show that this problem is no
 t more complex than the simple check of the opacity\, and then we propose 
 an algorithm\, implemented and evaluated in practice.\nThis presentation i
 s mainly based on publications at ACM TOSEM (2022)\, FTSCS 2022 and ICECCS
  2023\, and on join works with Étienne André\, Shapagat Bolat\, Engel Lefa
 ucheux\, Didier Lime and Sun Jun.
DTSTART;TZID=Europe/Paris:20230622T130000
DTEND;TZID=Europe/Paris:20230622T140000
LOCATION:salle 178\, zoom: https://bordeaux-inp-fr.zoom.us/j/89508306159
SEQUENCE:0
SUMMARY:[MTV] Dylan Marinho (LORIA) - Ensuring opacity in timed systems
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
