Masking against Side-Channel Attacks: A Formal Security Proof
From MaRDI portal
Publication:4924408
DOI10.1007/978-3-642-38348-9_9zbMath1306.94087OpenAlexW191000419MaRDI QIDQ4924408
Matthieu Rivain, Emmanuel Prouff
Publication date: 31 May 2013
Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_9
Related Items (32)
Towards tight random probing security ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Algebraic Decomposition for Probing Security ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Revisiting mutual information analysis: multidimensionality, neural estimation and optimality proofs ⋮ Masking and leakage-resilient primitives: one, the other(s) or both? ⋮ Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ Systematic study of decryption and re-encryption leakage: the case of Kyber ⋮ Removing the field size loss from Duc et al.'s conjectured bound for masked encodings ⋮ Secret can be public: low-memory AEAD mode for high-order masking ⋮ Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Unifying freedom and separation for tight probing-secure composition ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Unifying leakage models: from probing attacks to noisy leakage ⋮ Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison ⋮ Vectorizing Higher-Order Masking ⋮ Compositional Synthesis of Leakage Resilient Programs ⋮ Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model ⋮ How Fast Can Higher-Order Masking Be in Software? ⋮ Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version ⋮ Efficient Leakage Resilient Circuit Compilers ⋮ Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks ⋮ Optimal Amplification of Noisy Leakages ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ On the power of expansion: more efficient constructions in the random probing model ⋮ The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems ⋮ Random probing security: verification, composition, expansion and new constructions
This page was built for publication: Masking against Side-Channel Attacks: A Formal Security Proof
