We propose a novel approach for quantifying a system's resistance to unknown-message side-channel attacks. The approach is based on a measure of the secret information that an attacker can extract from a system from a given number of side-channel measurements. We provide an algorithm to compute this measure, and we use it to analyze the resistance of hardware implementations of cryptographic algorithms with respect to timing attacks. In particular, we show that message-blinding - the common countermeasure against timing attacks - reduces the rate at which information about the secret is leaked, but that the complete information is still eventually revealed. Finally, we compare information measures corresponding to unknown-message, known-message, and chosen-message attackers and show that they form a strict hierarchy. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Backes, M., & Köpf, B. (2008). Formally bounding the side-channel leakage in unknown-message attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5283 LNCS, pp. 517–532). Springer Verlag. https://doi.org/10.1007/978-3-540-88313-5_33
Mendeley helps you to discover research relevant for your work.