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_11zbMath1479.94126OpenAlexW3158681199MaRDI QIDQ2056735
Abdul Rahman Taleb, Matthieu Rivain, Sonia Belaïd
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_11
Related Items (2)
Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Dynamic random probing expansion with quasi linear asymptotic complexity
Cites Work
- Unnamed Item
- Private circuits: a modular approach
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- Side-channel masking with pseudo-random generator
- Random probing security: verification, composition, expansion and new constructions
- Simple refreshing in the noisy leakage model
- Higher-Order Side Channel Security and Mask Refreshing
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Provably Secure Higher-Order Masking of AES
- Masking against Side-Channel Attacks: A Formal Security Proof
- Towards sound approaches to counteract power-analysis attacks
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Higher Order Masking of Look-Up Tables
- Secure computation with information leaking to an adversary
- Advances in Cryptology - CRYPTO 2003
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
- Randomness Complexity of Private Circuits for Multiplication
This page was built for publication: On the power of expansion: more efficient constructions in the random probing model
