Generalized Current-State Opacity With Dynamically Changing Secrets
Dan You, Shouguang Wang, Carla Seatzu

TL;DR
This paper introduces a new concept called generalized current-state opacity (GCSO) for systems where secrets change dynamically, along with a verification method and practical illustration.
Contribution
It proposes the novel GCSO notion for dynamic secrets and provides a verification approach using a GCSO-verifier.
Findings
GCSO effectively models systems with evolving secrets.
A verification method for GCSO is developed.
Practical example demonstrates the approach.
Abstract
Opacity, an information-flow property related to the privacy and security of a system, has been extensively studied in the context of discrete event systems. Although various notions of opacity have been proposed, in all cases the considered secret was constant. This work focuses on current-state opacity, considering a scenario where the secret changes dynamically with the system evolution. In other words, we propose the new notion of generalized current-state opacity (GCSO), which is with respect to a dynamic-secret model rather than a constant secret. Moreover, we provide a method to verify GCSO based on the construction of the GCSO-verifier. Finally, a practical example is given to illustrate the proposed notion and the method for its verification.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity and Verification in Computing · Distributed systems and fault tolerance · Petri Nets in System Modeling
