Synthesis of opaque systems with static and dynamic masks
From MaRDI portal
Publication:453510
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
Cites work
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1884409 (Why is no real title available?)
- A characterization of the minimum cycle mean in a digraph
- Automated verification of selected equivalences for security protocols
- Borel determinacy
- Characterizing intransitive noninterference for 3-domain security policies with observability
- Concurrent secrets
- Dynamic Observers for the Synthesis of Opaque Systems
- Fault diagnosis with static and dynamic observers
- On the synthesis of strategies in infinite games
- Preserving Secrecy Under Refinement
- Supervisory Control for Opacity
- Test Generation for Network Security Rules
- The complexity of mean payoff games on graphs
Cited in
(29)- A framework for current-state opacity under dynamic information release mechanism
- Enforcement for infinite-step opacity and K-step opacity via insertion mechanism
- Verification of opacity and diagnosability for pushdown systems
- Dynamic Observers for the Synthesis of Opaque Systems
- A general approach for optimizing dynamic sensor activation for discrete event systems
- Synthesis of sensor deception attacks at the supervisory layer of cyber-physical systems
- Comparing the notions of opacity for discrete-event systems
- Decidability of opacity verification problems in labeled Petri net systems
- Matrix approach for verification of opacity of partially observed discrete event systems
- Information control in networked discrete event systems and its application to battery management systems
- Verification and enforcement of current-state opacity based on a state space approach
- Online verification of \(K\)-step opacity by Petri nets in centralized and decentralized structures
- Enforcing opacity by insertion functions under multiple energy constraints
- Concurrent secrets
- \(k\)-memory-embedded insertion mechanism for opacity enforcement
- Control and synthesis of non-interferent timed systems
- Synthesis of obfuscation policies to ensure privacy and utility
- Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems
- Probabilistic opacity for Markov decision processes
- A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
- Enforcement of opacity by public and private insertion functions
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Enforcing opacity of regular predicates on modal transition systems
- Enhancement of opacity for distributed state estimation in cyber-physical systems
- Enforcing current-state opacity through shuffle and deletions of event observations
- Current-state opacity enforcement in discrete event systems under incomparable observations
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Privacy-preserving co-synthesis against sensor-actuator eavesdropping intruder
- Synthesis of insertion functions for enforcement of opacity security properties
This page was built for publication: Synthesis of opaque systems with static and dynamic masks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453510)
