submit
english version rss feed
HAL: inria-00424852, version 1

See detailed view  BibTeX,EndNote,...
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009), Oxford : United Kingdom (2009)
Quantitative Notions of Leakage for One-try Attacks
Christelle Braun 1, Konstantinos Chatzikokolakis 1, Catuscia Palamidessi 1
(2009)

Recent research in quantitative theories for information-hiding topics, such as Anonymity and Secure Information Flow, tend to converge towards the idea of modeling the system as a noisy channel in the information-theoretic sense. The notion of information leakage, or vulnerability of the system, has been related in some approaches to the concept of mutual information of the channel. A recent work of Smith has shown, however, that if the attack consists in one single try, then the mutual information and other concepts based on Shannon entropy are not suitable, and he has proposed to use Rényi's min-entropy instead. In this paper, we consider and compare two different possibilities of defining the leakage, based on the Bayes risk, a concept related to Rényi min-entropy.
1:  COMETE (INRIA Saclay - Ile de France)
INRIA – Polytechnique - X – CNRS : UMR7161
Computer Science/Logic in Computer Science
Attached file list to this document: 
PDF
leakage.pdf(263.2 KB)

all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...