Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Private circuits: a modular approach
Masking proofs are tight and how to exploit it in security evaluations
Horizontal side-channel attacks and countermeasures on the ISW masking scheme
How to securely compute with noisy leakage in quasilinear complexity
Multivariate high-order attacks of shuffled tables recomputation
On the power of expansion: more efficient constructions in the random probing model
Random probing security: verification, composition, expansion and new constructions
Towards tight random probing security
Unifying leakage models on a Rényi day
Optimal Amplification of Noisy Leakages
Higher-Order Side Channel Security and Mask Refreshing
Masking Tables—An Underestimated Security Risk
Making Masking Security Proofs Concrete
Noisy Leakage Revisited
The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order <inline-formula> <tex-math notation="TeX">${2^{n}}$ </tex-math></inline-formula>
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
The Uniform Distribution as a Universal Prior
Provably Secure Higher-Order Masking of AES
A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
A theorem on the entropy of certain binary sequences and applications--I
Masking against Side-Channel Attacks: A Formal Security Proof
Towards sound approaches to counteract power-analysis attacks
Power Analysis Attacks
Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
Higher Order Masking of Look-Up Tables
Secure computation with information leaking to an adversary
Advances in Cryptology - CRYPTO 2003
How Far Can We Go Beyond Linear Cryptanalysis?
Elements of Information Theory
How Fast Can Higher-Order Masking Be in Software?
Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
Topics in Cryptology – CT-RSA 2004
Theory of Cryptography
Removing the field size loss from Duc et al.'s conjectured bound for masked encodings
Dynamic random probing expansion with quasi linear asymptotic complexity

This page was built for publication: Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model