Comparative analysis of related notions of opacity in centralized and coordinated architectures

Wu, Yi-Chin; Lafortune, Stéphane

doi:10.1007/s10626-012-0145-z

Cited by 178 publications

(126 citation statements)

References 20 publications

Supporting

Mentioning

121

Contrasting

Unclassified

Order By: Relevance

“…On the contrary, Cassez et al (2012) describes transformations from LBO to CSO. In Wu and Lafortune (2013), the authors extend these works and provide a full transformation mapping between LBO, CSO, ISO and IFO (initial-and-final state opacity -defined therein). In addition, we already mentioned that K-step opacity is an extension of CSO.…”

Section: Transformations Between Different Opacity Propertiesmentioning

confidence: 99%

“…The system is said to be concurrently opaque if all secrets are safe. A different notion, called joint opacity is presented in Wu and Lafortune (2013) and Wu (2014). In this setting, several intruders collaborate through a coordinator in order to discover the same secret.…”

Section: Distributed Opacitymentioning

confidence: 99%

“…The reference case of study is known as the Dinning cryptographers problem, introduced by Chaum (1988); see e.g., Bérard et al (2010), Wu and Lafortune (2013). It illustrates properties of ISO and CSO.…”

Section: Applications and Related Issuesmentioning

confidence: 99%

See 2 more Smart Citations

Opacity of Discrete Event Systems: models, validation and quantification

2015

View full text Add to dashboard Cite

International audienceOver the last decade, opacity of discrete event systems (DES) has become a very fertile field of research. Driven by safety and privacy concerns in network communications and online services, much theoretical work has been conducted in order to design opaque systems. A system is opaque if an external observer in unable to infer a " secret " about the system behavior. This paper aims to review the most commonly used techniques of opacity validation for deterministic models and opacity quantification for probabilistic ones. Available complexity results are also provided. Finally, we review existing tools for opacity validation and current applications

show abstract

Section: Transformations Between Different Opacity Propertiesmentioning

confidence: 99%

Section: Distributed Opacitymentioning

confidence: 99%

See 1 more Smart Citation

Opacity of Discrete Event Systems: models, validation and quantification

2015

View full text Add to dashboard Cite

show abstract

“…Wu and Lafortune [67] investigate a family of opacity policies for deterministic finite-state automata. They propose verification methods that are suitable for certifying opacity in the presence of a team of collaborating intruders.…”

Section: Related Workmentioning

confidence: 99%

Understanding and Enforcing Opacity

Schoepe

Sabelfeld

2015

2015 IEEE 28th Computer Security Foundations Symposium

View full text Add to dashboard Cite

Abstract-This paper puts a spotlight on the specification and enforcement of opacity, a security policy for protecting sensitive properties of system behavior. We illustrate the fine granularity of the opacity policy by location privacy and privacy-preserving aggregation scenarios. We present a framework for opacity and explore its key differences and formal connections with such well-known information-flow models as noninterference, knowledge-based security, and declassification. Our results are machine-checked and parameterized in the observational power of the attacker, including progressinsensitive, progress-sensitive, and timing-sensitive attackers. We present two approaches to enforcing opacity: a whitebox monitor and a blackbox sampling-based enforcement. We report on experiments with prototypes that utilize state-of-the-art Satisfiability Modulo Theories (SMT) solvers and the random testing tool QuickCheck to establish opacity for the location and aggregation-based scenarios.

show abstract

“…This can be performed a priori or at run-time for a given observed sequence of the system. There are other variants of this problem, like language-based, initial, k-step, infinite, initial-and-final opacity Hadjicostis 2008, 2012;Cassez et al 2012, Wu andLafortune 2013). On the other hand, the field of diagnosis concerns systems that may have faulty behaviors.…”

Section: Introductionmentioning

confidence: 99%

Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems

Chédor

Morvan

Pinchinat

et al. 2014

Discrete Event Dyn Syst

View full text Add to dashboard Cite

The analysis of discrete event systems under partial observation is an important topic, with major applications such as the detection of information flow and the diagnosis of faulty behaviors. These questions have, mostly, not been addressed for classical models of recursive systems, such as pushdown systems and recursive state machines. In this paper, we consider recursive tile systems, which are recursive infinite systems generated by a finite collection of finite tiles, a simplified variant of deterministic graph grammars (slightly more general than pushdown systems). Since these systems are infinite-state in general powerset constructions for monitoring do not always apply. We exhibit computable conditions on recursive tile systems and present non-trivial constructions that yield effective computation of the monitors. We apply these results to the classic problems of state-based opacity and diagnosability (off-line verification of opacity and diagnosability, and also runtime monitoring of these properties). For a decidable subclass of recursive tile systems, we also establish the decidability of the problems of state-based opacity and diagnosability.

show abstract

Comparative analysis of related notions of opacity in centralized and coordinated architectures

Cited by 178 publications

References 20 publications

Opacity of Discrete Event Systems: models, validation and quantification

Opacity of Discrete Event Systems: models, validation and quantification

Understanding and Enforcing Opacity

Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems

Contact Info

Product

Resources

About