On the power of expansion: more efficient constructions in the random probing model
From MaRDI portal
Publication:2056735
DOI10.1007/978-3-030-77886-6_11zbMATH Open1479.94126OpenAlexW3158681199MaRDI QIDQ2056735FDOQ2056735
Authors: Sonia Belaïd, Matthieu Rivain, Abdul Rahman Taleb 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_11
Recommendations
Cites Work
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Randomness complexity of private circuits for multiplication
- Advances in Cryptology - CRYPTO 2003
- Towards sound approaches to counteract power-analysis attacks
- Provably secure higher-order masking of AES
- Title not available (Why is that?)
- Private circuits: a modular approach
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- Higher-order side channel security and mask refreshing
- Higher order masking of look-up tables
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Masking against Side-Channel Attacks: A Formal Security Proof
- Unifying leakage models: from probing attacks to noisy leakage.
- Random probing security: verification, composition, expansion and new constructions
- Secure computation with information leaking to an adversary
- Circuit compilers with \(O(1/\log (n))\) leakage rate
- Side-channel masking with pseudo-random generator
- Simple refreshing in the noisy leakage model
Cited In (7)
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- Exploiting algebraic structures in probing security
- 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
- Towards tight random probing security
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
This page was built for publication: On the power of expansion: more efficient constructions in the random probing model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056735)
