.png){kind=icon}
.png){kind=icon}
Return
Embedded Insertion Functions for Opacity Enforcement
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2020.3037891.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We investigate the enforcement of opacity, an information-flow privacy property, using insertion sequences that modify the output of the system by event insertions. Previous work considered the problem of enforcing the opacity under the assumption that the insertion functions were based on the observed system strings. Now, we investigate the more powerful method of insertion sequences based on the exact system states and events. In this case, the insertion function would be embedded into the system itself, rather than being an output interface. In this article, we develop methods that verify if a valid insertion function exists in this setting; if one exists, synthesize one using a computationally effective algorithm; and investigate a special case where it is possible to verify and synthesize a valid embedded insertion function with polynomial complexity in the size of the system.
Keywords:
Automata
Servers
Privacy
Runtime
Prediction algorithms
Observers
Monitoring
Discrete event systems
finite automata
opacity
privacy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W