Towards tight random probing security
From MaRDI portal
Publication:2128995
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
- scientific article; zbMATH DE number 1979272 (Why is no real title available?)
- scientific article; zbMATH DE number 1878336 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Circuit compilers with \(O(1/\log (n))\) leakage rate
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Formal verification of masked hardware implementations in the presence of glitches
- Hardware Private Circuits: From Trivial Composition to Full Verification
- Higher-order side channel security and mask refreshing
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- How to securely compute with noisy leakage in quasilinear complexity
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Masking against Side-Channel Attacks: A Formal Security Proof
- Noisy leakage revisited
- Private circuits: a modular approach
- Random probing security: verification, composition, expansion and new constructions
- SILVER -- statistical independence and leakage verification
- Secure computation with information leaking to an adversary
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Simple refreshing in the noisy leakage model
- Theoretical and practical aspects of mutual information-based side channel analysis
- Topics in Cryptology – CT-RSA 2005
- Towards sound approaches to counteract power-analysis attacks
- Unifying leakage models on a Rényi day
- Unifying leakage models: from probing attacks to noisy leakage
Cited in
(18)- The random fault model
- Algorithmic Tamper-Proof Security under Probing Attacks
- Unifying freedom and separation for tight probing-secure composition
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
- On the power of expansion: more efficient constructions in the random probing model
- Exploiting algebraic structures in probing security
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- How to stretch random functions: The security of protected counter sums
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- Dynamic random probing expansion with quasi linear asymptotic complexity
- Algebraic decomposition for probing security
- From random probing to noisy leakages without field-size dependence
- Tight private circuits: achieving probing security with the least refreshing
- Security Against Related Randomness Attacks via Reconstructive Extractors
- Secure wire shuffling in the probing model
- Randomness complexity of private circuits for multiplication
- Random probing security: verification, composition, expansion and new constructions
- Cryptanalysis of masked ciphers: a not so random idea
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)
