Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
From MaRDI portal
Publication:5418709
DOI10.1007/978-3-642-55220-5_24zbMath1326.94086OpenAlexW1541150254MaRDI QIDQ5418709
Stefan Dziembowski, Sebastian Faust, Alexandre Duc
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/198833/files/paper.pdf
Related Items (48)
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation ⋮ Impossibility of Black-Box Simulation Against Leakage Attacks ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Algebraic Decomposition for Probing Security ⋮ Consolidating Masking Schemes ⋮ Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage ⋮ Private circuits with quasilinear randomness ⋮ Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy ⋮ Threshold implementations of small S-boxes ⋮ Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks ⋮ 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 ⋮ Programmable distributed point functions ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Combined fault and leakage resilience: composability, constructions and compiler ⋮ Dynamic random probing expansion with quasi linear asymptotic complexity ⋮ Bridging the gap: advanced tools for side-channel leakage estimation beyond Gaussian templates and histograms ⋮ Uniform first-order threshold implementations ⋮ Unifying freedom and separation for tight probing-secure composition ⋮ SILVER -- statistical independence and leakage verification ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Reducing Randomness Complexity of Mask Refreshing Algorithm ⋮ Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison ⋮ A First-Order SCA Resistant AES Without Fresh Randomness ⋮ Compositional Synthesis of Leakage Resilient Programs ⋮ Маскирование ГОСТ 28147-89 для защиты от атак по побочным каналам ⋮ Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model ⋮ How Fast Can Higher-Order Masking Be in Software? ⋮ Masking the GLP lattice-based signature scheme at any order ⋮ Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version ⋮ Efficient Leakage Resilient Circuit Compilers ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks ⋮ Optimal Amplification of Noisy Leakages ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ Side-channel masking with pseudo-random generator ⋮ On the power of expansion: more efficient constructions in the random probing model ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages ⋮ 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 ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets ⋮ Random probing security: verification, composition, expansion and new constructions ⋮ Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle
This page was built for publication: Unifying Leakage Models: From Probing Attacks to Noisy Leakage.