Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F23%3A73620789" target="_blank" >RIV/61989592:15310/23:73620789 - isvavai.cz</a>

Výsledek na webu

<a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.16" target="_blank" >https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.16</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPICS.MFCS.2023.16" target="_blank" >10.4230/LIPICS.MFCS.2023.16</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification

Popis výsledku v původním jazyce

Opacity is a property of privacy and security applications asking whether, given a system model, a passive intruder that makes online observations of system’s behaviour can ascertain some &quot;secret&quot; information of the system. Deciding opacity is a PSpace-complete problem, and hence there are no polynomial-time algorithms to verify opacity under the assumption that PSpace differs from PTime. This assumption, however, gives rise to a question whether the existing exponential-time algorithms are the best possible or whether there are faster, sub-exponential-time algorithms. We show that under the (Strong) Exponential Time Hypothesis, there are no algorithms that would be significantly faster than the existing algorithms. As a by-product, we obtained a new conditional lower bound on the time complexity of deciding universality (and therefore also inclusion and equivalence) for nondeterministic finite automata.

Název v anglickém jazyce

Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification

Popis výsledku anglicky

Opacity is a property of privacy and security applications asking whether, given a system model, a passive intruder that makes online observations of system’s behaviour can ascertain some &quot;secret&quot; information of the system. Deciding opacity is a PSpace-complete problem, and hence there are no polynomial-time algorithms to verify opacity under the assumption that PSpace differs from PTime. This assumption, however, gives rise to a question whether the existing exponential-time algorithms are the best possible or whether there are faster, sub-exponential-time algorithms. We show that under the (Strong) Exponential Time Hypothesis, there are no algorithms that would be significantly faster than the existing algorithms. As a by-product, we obtained a new conditional lower bound on the time complexity of deciding universality (and therefore also inclusion and equivalence) for nondeterministic finite automata.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2023

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 statě ve sborníku

48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)

ISBN

978-3-95977-292-1

ISSN

—

e-ISSN

—

Počet stran výsledku

15

Strana od-do

"16-1"-"16-15"

Název nakladatele

Schloss-Dagstuhl - Leibniz Zentrum für Informatik

Místo vydání

Schloss-Dagstuhl, Leibniz Zentrum für Informatik

Místo konání akce

Bordeaux

Datum konání akce

28. 8. 2023

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—