Opacity and Abstraction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Opacity and Abstraction


The opacity property characterizes the absence of confidential information flow towards inquisitive attackers. Verifying opacity is well established for finite automata but is known to be not decidable for more expressive models like Turing machines or Petri nets. As a consequence, for a system dealing with confidential information, certifying its confidentiality may be impossible, but attackers can infer confidential information by approximating systems' behaviours. Taking such attackers into account, we investigate the verification of opacity using abstraction techniques to compute executable counterexamples (attack scenarios). Considering a system and a predicate over its executions, attackers are modeled as semi-conservative decision process determining from observed traces the truth of that predicate. Moreover, we will show that the most precise the abstraction is, the most accurate (and then dangerous) the corresponding class of attackers will be. Consequently, when no attack scenario is detected on an approximate analysis, we know that this system is safe against all ``less precise'' attackers. This can therefore be used to provide a level of certification relative to the precision of abstractions.
No file

Dates and versions

inria-00422452 , version 1 (07-10-2009)


  • HAL Id : inria-00422452 , version 1


Jérémy Dubreil. Opacity and Abstraction. Proceedings of the First International Workshop on Abstractions for Petri Nets and Other Models of Concurrency (APNOC'09), Jun 2009, Paris, France. ⟨inria-00422452⟩


29 View
0 Download


Gmail Facebook X LinkedIn More