A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Asymptotic Information Leakage under One-Try Attacks
[chapter]
2011
Lecture Notes in Computer Science
We study the asymptotic behaviour of (a) information leakage and (b) adversary's error probability in information hiding systems modelled as noisy channels. Specifically, we assume the attacker can make a single guess after observing n independent executions of the system, throughout which the secret information is kept fixed. We show that the asymptotic behaviour of quantities (a) and (b) can be determined in a simple way from the channel matrix. Moreover, simple and tight bounds on them as
doi:10.1007/978-3-642-19805-2_27
fatcat:pxzljhahunhv5dqcz2d35fxodu