Computing the leakage of information-hiding systems Conference

Andrés, ME, Palamidessi, C, Van Rossum, P et al. (2010). Computing the leakage of information-hiding systems . EURO-PAR 2011 PARALLEL PROCESSING, PT 1, 6015 LNCS 373-389. 10.1007/978-3-642-12002-2_32

cited authors

  • Andrés, ME; Palamidessi, C; Van Rossum, P; Smith, G

authors

abstract

  • We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the other based on techniques from quantitative counterexample generation. The second approach can be used either for exact or approximate computation, and provides feedback for debugging. These methods can be applied also in the case in which the input distribution is unknown. We then consider the interactive case and we point out that the definition of associated channel proposed in literature is not sound. We show however that the leakage can still be defined consistently, and that our methods extend smoothly. © 2010 Springer-Verlag.

publication date

  • January 1, 2010

published in

Digital Object Identifier (DOI)

start page

  • 373

end page

  • 389

volume

  • 6015 LNCS