On the power of expansion: more efficient constructions in the random probing model

DOI10.1007/978-3-030-77886-6_11MaRDI QIDQ2056735zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

maskingrandom probing modelside-channel security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Random probing security: verification, composition, expansion and new constructions
• Dynamic random probing expansion with quasi linear asymptotic complexity
• Towards tight random probing security
• Noisy leakage revisited
• Circuit compilers with \(O(1/\log (n))\) leakage rate

Cites work

• scientific article; zbMATH DE number 1504808 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Circuit compilers with \(O(1/\log (n))\) leakage rate
• Higher order masking of look-up tables
• Higher-order side channel security and mask refreshing
• Horizontal side-channel attacks and countermeasures on the ISW masking scheme
• Masking against Side-Channel Attacks: A Formal Security Proof
• Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
• Private circuits: a modular approach
• Provably secure higher-order masking of AES
• Random probing security: verification, composition, expansion and new constructions
• Randomness complexity of private circuits for multiplication
• Secure computation with information leaking to an adversary
• Side-channel masking with pseudo-random generator
• Simple refreshing in the noisy leakage model
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
• Towards sound approaches to counteract power-analysis attacks
• Unifying leakage models: from probing attacks to noisy leakage.

Cited in

(7)

• Towards tight random probing security
• Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
• Exploiting algebraic structures in probing security
• 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
• From random probing to noisy leakages without field-size dependence
• Random probing security: verification, composition, expansion and new constructions

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)