You Don't Know What I Know: On Notion of High-Order Opacity in Discrete-Event Systems
In this paper, we investigate a class of information-flow security properties called opacity in partial-observed discrete-event systems. Roughly speaking, a system is said to be opaque if the intruder, which is modeled by a passive observer, can never determine the "secret" of the system for sure. Most of the existing notions of opacity consider secrets related to the actual behaviors of the system. In this paper, we consider a new type of secret related to the knowledge of the system user. Specifically, we assume that the system user also only has partial observation of the system and has to reason the actual behavior of the system. We say a system is high-order opaque if the intruder can never determine that the system user knows some information of importance based on its own incomparable information. We provide the formal definition of high-order opacity. Two algorithms are provided for the verification of this new notion: one with doubly-exponential complexity for the worst case and the other with single-exponential complexity. Illustrative examples are provided for the new notion of high-order opacity.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Word Order Does Matter and Shuffled Language Models Know It
Recent studies have shown that language models pretrained and/or fine-tuned on randomly permuted sentences exhibit competitive performance on GLUE, putting into question the importance of word order information. Somewhat…
PositionSegmentationSentenceVariable Forgetting in Reasoning about Knowledge
In this paper, we investigate knowledge reasoning within a simple framework called knowledge structure. We use variable forgetting as a basic operation for one agent to reason about its own or other agents\ knowledge. In…
Knowledge, Justification, and Adequate Reasons
Is knowledge definable as justified true belief ("JTB")? We argue that one can legitimately answer positively or negatively, depending on whether or not one's true belief is justified by what we call adequate reasons. To…
Provable Uncertainty Decomposition via Higher-Order Calibration
We give a principled method for decomposing the predictive uncertainty of a model into aleatoric and epistemic components with explicit semantics relating them to the real-world data distribution. While many works in the…
image-classificationImage ClassificationWhen is a Prediction Knowledge?
Within Reinforcement Learning, there is a growing collection of research which aims to express all of an agent's knowledge of the world through predictions about sensation, behaviour, and time. This work can be seen not …
Decision MakingPredictionreinforcement-learningReinforcement Learning+1