Log In Sign Up

Parametric Timed Model Checking for Guaranteeing Timed Opacity

by   Étienne André, et al.

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage is the ability for an attacker to deduce internal information depending on the system execution time. We address the following problem: given a timed system, synthesize the execution times for which one cannot deduce whether the system performed some secret behavior. We solve this problem in the setting of timed automata (TAs). We first provide a general solution, and then extend the problem to parametric TAs, by synthesizing internal timings making the TA secure. We study decidability, devise algorithms, and show that our method can also apply to program analysis.


page 1

page 2

page 3

page 4


Guaranteeing Timed Opacity using Parametric Timed Model Checking

Information leakage can have dramatic consequences on systems security. ...

Time-free solution to independent set problem using P systems with active membranes

Membrane computing is a branch of natural computingwhich abstracts fromt...

strategFTO: Untimed control for timed opacity

We introduce a prototype tool strategFTO addressing the verification of ...

On the Incomparability of Cache Algorithms in Terms of Timing Leakage

Modern computer architectures rely on caches to reduce the latency gap b...

CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity

Information flow security ensures that the secret data manipulated by a ...

Quantifying Dynamic Leakage: Complexity Analysis and Model Counting-based Calculation

A program is non-interferent if it leaks no secret information to an obs...

ct-fuzz: Fuzzing for Timing Leaks

Testing-based methodologies like fuzzing are able to analyze complex sof...