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 DegradationImpossibility of Black-Box Simulation Against Leakage AttacksSecure Computation from Leaky Correlated RandomnessAlgebraic Decomposition for Probing SecurityConsolidating Masking SchemesLeakage-Resilient Identification Schemes from Zero-Knowledge Proofs of StoragePrivate circuits with quasilinear randomnessUnifying Leakage Classes: Simulatable Leakage and PseudoentropyThreshold implementations of small S-boxesEffective and efficient masking with low noise using small-Mersenne-prime ciphersA Better Chain Rule for HILL Pseudoentropy - Beyond Bounded LeakageKey continual-leakage resilient broadcast cryptosystem from dual system in broadcast networksSystematic study of decryption and re-encryption leakage: the case of KyberRemoving the field size loss from Duc et al.'s conjectured bound for masked encodingsProgrammable distributed point functionsProuff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage modelCombined fault and leakage resilience: composability, constructions and compilerDynamic random probing expansion with quasi linear asymptotic complexityBridging the gap: advanced tools for side-channel leakage estimation beyond Gaussian templates and histogramsUniform first-order threshold implementationsUnifying freedom and separation for tight probing-secure compositionSILVER -- statistical independence and leakage verificationPacked multiplication: how to amortize the cost of side-channel masking?Reducing Randomness Complexity of Mask Refreshing AlgorithmSecure Multiplication for Bitslice Higher-Order Masking: Optimisation and ComparisonA First-Order SCA Resistant AES Without Fresh RandomnessCompositional Synthesis of Leakage Resilient ProgramsМаскирование ГОСТ 28147-89 для защиты от атак по побочным каналамParallel Implementations of Masking Schemes and the Bounded Moment Leakage ModelHow Fast Can Higher-Order Masking Be in Software?Masking the GLP lattice-based signature scheme at any orderMaking masking security proofs concrete (or how to evaluate the security of any leaking device), extended versionEfficient Leakage Resilient Circuit CompilersOn the local leakage resilience of linear secret sharing schemesRobust Pseudo-Random Number Generators with Input Secure Against Side-Channel AttacksOptimal Amplification of Noisy LeakagesUnconditionally secure computation against low-complexity leakagePolynomial Evaluation and Side Channel AnalysisCorrection to: ``Unconditionally secure computation against low-complexity leakageLocally decodable and updatable non-malleable codes and their applicationsSide-channel masking with pseudo-random generatorOn the power of expansion: more efficient constructions in the random probing modelLeakage-resilience of the Shamir secret-sharing scheme against physical-bit leakagesThe mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for freeTowards Sound Fresh Re-keying with Hard (Physical) Learning ProblemsBounded Indistinguishability and the Complexity of Recovering SecretsRandom probing security: verification, composition, expansion and new constructionsMode-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.