Always guarding you: Strong initial-and-final-state opacity of discrete-event systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F25%3A00603997" target="_blank" >RIV/67985840:_____/25:00603997 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1016/j.automatica.2024.112085" target="_blank" >https://doi.org/10.1016/j.automatica.2024.112085</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.automatica.2024.112085" target="_blank" >10.1016/j.automatica.2024.112085</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Always guarding you: Strong initial-and-final-state opacity of discrete-event systems

Popis výsledku v původním jazyce

Opacity is a security property of discrete-event systems that specifies whether the secret can be concealed from an external intruder. In this paper, we proposed two advanced variants of initial-and-final-state opacity, namely partially strong initial-and-final-state opacity (PSIFO) and strong initial-and-final-state opacity (SIFO), which impose more stringent security requirements, for discrete-event systems modeled by nondeterministic finite-state automata. SIFO (resp. PSIFO) is a property that for each path between a given secret state pair, there exists a strongly non-secret-pair path (resp. non-secret-pair path), with the same observation as that path. In other words, the strong version of initial-and-final-state opacity requires the existence of at least one path always guarding the secret. Furthermore, we conduct an analysis of the reductions from strong current-state opacity and initial-state opacity to PSIFO. Finally, two concurrent composition-based information structures are proposed to verify these two properties, the size of which grows exponentially with the number of states of the original system.

Název v anglickém jazyce

Always guarding you: Strong initial-and-final-state opacity of discrete-event systems

Popis výsledku anglicky

Opacity is a security property of discrete-event systems that specifies whether the secret can be concealed from an external intruder. In this paper, we proposed two advanced variants of initial-and-final-state opacity, namely partially strong initial-and-final-state opacity (PSIFO) and strong initial-and-final-state opacity (SIFO), which impose more stringent security requirements, for discrete-event systems modeled by nondeterministic finite-state automata. SIFO (resp. PSIFO) is a property that for each path between a given secret state pair, there exists a strongly non-secret-pair path (resp. non-secret-pair path), with the same observation as that path. In other words, the strong version of initial-and-final-state opacity requires the existence of at least one path always guarding the secret. Furthermore, we conduct an analysis of the reductions from strong current-state opacity and initial-state opacity to PSIFO. Finally, two concurrent composition-based information structures are proposed to verify these two properties, the size of which grows exponentially with the number of states of the original system.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20205 - Automation and control systems

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Automatica

ISSN

0005-1098

e-ISSN

1873-2836

Svazek periodika

173

Číslo periodika v rámci svazku

March

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

9

Strana od-do

112085

Kód UT WoS článku

001399243100001

EID výsledku v databázi Scopus

2-s2.0-85214289059