.png){kind=icon}
返回
Guaranteeing Timed Opacity using Parametric Timed Model Checking
.png){kind=icon}
OA
AI
DOI：10.1145/3502851.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Opacity
timed automata
IMITATOR
parameter synthesis
期刊
A
IF:
6.2
论文数:
1.2K
被引数:
3.4K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Concentrations and origin of polycyclic aromatic hydrocarbons in sediments of the Middle Adriatic Sea亚得里亚海中部沉积物中多环芳烃的浓度和来源
OAAI
OAAI分享收藏Magnetic properties of CoFe1.9RE0.1O4 nanoparticles (RE=La, Ce, Nd, Sm, Eu, Gd, Tb, Ho) prepared in polyol在多元醇中制备的CoFe1.9RE0.1O4纳米颗粒 (RE = La，Ce，Nd，Sm，Eu，Gd，Tb，Ho) 的磁性能
PREAI
分享收藏
查看更多内容