 |
|
|
|
| HAL: hal-00445445, version 1 |
| Detailed view |  Export this paper |
|
|
| Sixteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Chypre (2010) |
|
|
|
|
| Computing the Leakage of Information-Hiding Systems |
|
|
| Miguel Andrés 1Catuscia Palamidessi 2 |
|
|
| (2010) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Computing Science Department (CS) |
|
|
|
Radboud university of Nijmegen |
|
|
| 2: | COMETE (INRIA Saclay - Ile de France) |
|
|
|
INRIA – Polytechnique - X – CNRS : UMR7161 |
|
|
| 3: | School of Computing and Information Science |
|
|
|
Florida International University |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Cryptography and Security |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00445445, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00445445/en/ | |
| oai:hal.archives-ouvertes.fr:hal-00445445_v1 | |
| From: Catuscia Palamidessi | |
| Submitted on: Friday, 8 January 2010 15:03:36 | |
| Updated on: Sunday, 10 January 2010 23:54:44 | |
