Information Leakage of Non-Terminating Processes

Abstract : In recent years, quantitative security techniques have been providing effective measures of the security of a system against an attacker. Such techniques usually assume that the system produces a finite amount of observations based on a finite amount of secret bits and terminates, and the attack is based on these observations. By modeling systems with Markov chains, we are able to measure the effectiveness of attacks on non-terminating systems. Such systems do not necessarily produce a finite amount of output and are not necessarily based on a finite amount of secret bits. We provide characterizations and algorithms to define meaningful measures of security for non-terminating systems, and to compute them when possible. We also study the bounded versions of the problems, and show examples of non-terminating programs and how their effectiveness in protecting their secret can be measured.
Liste complète des métadonnées

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01086879
Contributor : Fabrizio Biondi <>
Submitted on : Wednesday, December 10, 2014 - 4:26:07 PM
Last modification on : Friday, March 22, 2019 - 4:46:03 PM
Document(s) archivé(s) le : Wednesday, March 11, 2015 - 10:06:04 AM

File

main.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Pasquale Malacaria, Andrzej Wasowski. Information Leakage of Non-Terminating Processes. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2014, Delhi, India. ⟨10.4230/LIPIcs.FSTTCS.2014.517⟩. ⟨hal-01086879⟩

Share

Metrics

Record views

1450

Files downloads

80