Year: 2022
Type: article
Abstract: 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 information. In this work, we consider that the attacker has access (only) to the system execution time. We address the following timed opacity problem: given a timed system, a private location and a final location, synthesize the execution times from the initial location to the final location for which one cannot deduce whether the system went through the private location. We also consider the full timed opacity problem, asking whether the system is opaque for all execution times. We show that these problems are decidable for timed automata (TAs) but become undecidable when one adds parameters, yielding parametric timed automata (PTAs). We identify a subclass with some decidability results. We then devise an algorithm for synthesizing PTAs parameter valuations guaranteeing that the resulting TA is opaque. We finally show that our method can also apply to program analysis.
DOI: 10.1145/3502851
Authors: Étienne André, Didier Lime, Dylan Marinho, Jun Sun
Institutions: Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire Lorrain de Recherche en Informatique et ses Applications, Laboratoire d'Informatique de Paris-Nord, VERIDIS: Modeling and Verification of Distributed Algorithms and Systems, Université de Lorraine, École Centrale de Nantes, Laboratoire des Sciences du Numérique de Nantes, Nantes Université, Singapore Management University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Agence Nationale de la Recherche
OpenAlex ID: W4282966423