Information Flow for Timed Automata

Nielson, Flemming; Nielson, Hanne Riis; Vasilikos, Panagiotis

doi:10.1007/978-3-319-63121-9_1

Cited by 8 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [NNV17], the authors propose a type system dealing with non-determinism and (continuous) real-time, the adequacy of which is ensured using non-interference. We share the common formalism of TAs; however, we mainly focus on leakage as execution time, and we synthesize internal parts of the system (clock guards), in contrast to [NNV17] where the system is fixed.…”

Section: Contributions For Parametric Tasmentioning

confidence: 99%

Guaranteeing Timed Opacity using Parametric Timed Model Checking

André,

Lime,

Marinho

et al. 2022

Preprint

View full text Add to dashboard Cite

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.

show abstract

Section: Contributions For Parametric Tasmentioning

confidence: 99%

Guaranteeing Timed Opacity using Parametric Timed Model Checking

André,

Lime,

Marinho

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…In [NNV17], the authors propose a type system dealing with non-determinism and (continuous) real-time, the adequacy of which is ensured using noninterference. We share the common formalism of TA; however, we mainly focus on leakage as execution time, and we synthesize internal parts of the system (clock guards), in contrast to [NNV17] where the system is fixed.…”

Section: Related Workmentioning

confidence: 99%

Parametric Timed Model Checking for Guaranteeing Timed Opacity

André¹,

Sun²

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

0000−0001−8473−9555] and Sun Jun 4[0000−0002−3545−1392]Abstract. 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.

show abstract

“…Different from the above-mentioned work, our work considers parametric timed automata, i. e., timed systems with unknown design parameters, and focuses on synthesizing parameter valuations which guarantee non-interference. In [NNV17], the authors propose a type system dealing with non-determinism and (continuous) real-time, the adequacy of which is ensured using non-interference. We share the common formalism of TA; however, we mainly focus on non-interference seen as the set of reachable locations, and we synthesize internal parts of the system (clock guards), in contrast to [NNV17] where the system is fixed.…”

Section: Introductionmentioning

confidence: 99%

“…In [NNV17], the authors propose a type system dealing with non-determinism and (continuous) real-time, the adequacy of which is ensured using non-interference. We share the common formalism of TA; however, we mainly focus on non-interference seen as the set of reachable locations, and we synthesize internal parts of the system (clock guards), in contrast to [NNV17] where the system is fixed. c) Outline: In Section II, we recall the necessary preliminaries, including non-interference for TAs.…”

Section: Introductionmentioning

confidence: 99%

Parametric non-interference in timed automata

André¹,

Kryukov²

2020

2020 25th International Conference on Engineering of Complex Computer Systems (ICECCS)

View full text Add to dashboard Cite

We consider a notion of non-interference for timed automata (TAs) that allows to quantify the frequency of an attack; that is, we infer values of the minimal time between two consecutive actions of the attacker, so that (s)he disturbs the set of reachable locations. We also synthesize valuations for the timing constants of the TA (seen as parameters) guaranteeing non-interference. We show that this can reduce to reachability synthesis in parametric timed automata. We apply our method to a model of the Fischer mutual exclusion protocol and obtain preliminary results.

show abstract

Information Flow for Timed Automata

Cited by 8 publications

References 15 publications

Guaranteeing Timed Opacity using Parametric Timed Model Checking

Guaranteeing Timed Opacity using Parametric Timed Model Checking

Parametric Timed Model Checking for Guaranteeing Timed Opacity

Parametric non-interference in timed automata

Contact Info

Product

Resources

About