Synthesis of opaque systems with static and dynamic masks
DOI10.1007/S10703-012-0141-9zbMATH Open1247.68161OpenAlexW2001653139MaRDI QIDQ453510FDOQ453510
Authors: Franck Cassez, Jérémy Dubreil, H. Marchand 
Publication date: 27 September 2012
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-012-0141-9
Recommendations
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)
Cites Work
- The complexity of mean payoff games on graphs
- Borel determinacy
- A characterization of the minimum cycle mean in a digraph
- Title not available (Why is that?)
- Fault diagnosis with static and dynamic observers
- On the synthesis of strategies in infinite games
- Concurrent secrets
- Preserving Secrecy Under Refinement
- Dynamic Observers for the Synthesis of Opaque Systems
- Supervisory Control for Opacity
- Title not available (Why is that?)
- Automated verification of selected equivalences for security protocols
- Test Generation for Network Security Rules
- Characterizing intransitive noninterference for 3-domain security policies with observability
Cited In (29)
- Enforcing opacity by insertion functions under multiple energy constraints
- Matrix approach for verification of opacity of partially observed discrete event systems
- Comparing the notions of opacity for discrete-event systems
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Enforcing opacity of regular predicates on modal transition systems
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Synthesis of sensor deception attacks at the supervisory layer of cyber-physical systems
- A general approach for optimizing dynamic sensor activation for discrete event systems
- Control and synthesis of non-interferent timed systems
- A framework for current-state opacity under dynamic information release mechanism
- Enforcement for infinite-step opacity and K-step opacity via insertion mechanism
- Probabilistic opacity for Markov decision processes
- Concurrent secrets
- Verification and enforcement of current-state opacity based on a state space approach
- A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
- Synthesis of insertion functions for enforcement of opacity security properties
- Dynamic Observers for the Synthesis of Opaque Systems
- Synthesis of obfuscation policies to ensure privacy and utility
- \(k\)-memory-embedded insertion mechanism for opacity enforcement
- Current-state opacity enforcement in discrete event systems under incomparable observations
- Verification of opacity and diagnosability for pushdown systems
- Decidability of opacity verification problems in labeled Petri net systems
- Enhancement of opacity for distributed state estimation in cyber-physical systems
- Enforcing current-state opacity through shuffle and deletions of event observations
- Privacy-preserving co-synthesis against sensor-actuator eavesdropping intruder
- Enforcement of opacity by public and private insertion functions
- Online verification of \(K\)-step opacity by Petri nets in centralized and decentralized structures
- Information control in networked discrete event systems and its application to battery management systems
- Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems
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)
