Towards tight random probing security
From MaRDI portal
Publication:2128995
DOI10.1007/978-3-030-84252-9_7zbMATH Open1486.94083OpenAlexW3184500914MaRDI QIDQ2128995FDOQ2128995
Authors: Gaëtan Cassiers, Sebastian Faust, Maximilian Orlt, François-Xavier Standaert 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_7
Recommendations
- Random probing security: verification, composition, expansion and new constructions
- Tight private circuits: achieving probing security with the least refreshing
- Dynamic random probing expansion with quasi linear asymptotic complexity
- Noisy leakage revisited
- On the power of expansion: more efficient constructions in the random probing model
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Towards sound approaches to counteract power-analysis attacks
- Topics in Cryptology – CT-RSA 2005
- Theoretical and practical aspects of mutual information-based side channel analysis
- Private circuits: a modular approach
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- Higher-order side channel security and mask refreshing
- Masking against Side-Channel Attacks: A Formal Security Proof
- Random probing security: verification, composition, expansion and new constructions
- Unifying leakage models on a Rényi day
- Formal verification of masked hardware implementations in the presence of glitches
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- How to securely compute with noisy leakage in quasilinear complexity
- Unifying leakage models: from probing attacks to noisy leakage
- Noisy leakage revisited
- Secure computation with information leaking to an adversary
- Circuit compilers with \(O(1/\log (n))\) leakage rate
- Simple refreshing in the noisy leakage model
- SILVER -- statistical independence and leakage verification
- Hardware Private Circuits: From Trivial Composition to Full Verification
Cited In (15)
- Algebraic decomposition for probing security
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- Algorithmic Tamper-Proof Security under Probing Attacks
- Secure wire shuffling in the probing model
- How to stretch random functions: The security of protected counter sums
- Randomness complexity of private circuits for multiplication
- On the power of expansion: more efficient constructions in the random probing model
- Dynamic random probing expansion with quasi linear asymptotic complexity
- From random probing to noisy leakages without field-size dependence
- Random probing security: verification, composition, expansion and new constructions
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
- Cryptanalysis of masked ciphers: a not so random idea
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- Tight private circuits: achieving probing security with the least refreshing
- Security Against Related Randomness Attacks via Reconstructive Extractors
Uses Software
This page was built for publication: Towards tight random probing security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128995)
