Random probing security: verification, composition, expansion and new constructions

DOI10.1007/978-3-030-56784-2_12MaRDI QIDQ2096491zbMATH OpenOpenAlexFDO

Authors Sonia Belaïd, Jean-Sébastien Coron, Emmanuel Prouff, Matthieu Rivain, Abdul Rahman Taleb

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-56784-2_12

zbMATH Keywords

automated verificationmaskingcompilerrandom probing model

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Theory of compilers and interpreters (68N20)

Recommendations

• Towards tight random probing security
• On the power of expansion: more efficient constructions in the random probing model
• Dynamic random probing expansion with quasi linear asymptotic complexity
• Noisy leakage revisited
• Side-channel masking with pseudo-random generator

Cites work

• scientific article; zbMATH DE number 1952886 (Why is no real title available?)
• scientific article; zbMATH DE number 1504808 (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
• Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
• Formal verification of side-channel countermeasures via elementary circuit transformations
• 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
• Player simulation and general adversary structures in perfect multiparty computation
• Private circuits: a modular approach
• Private multiplication over finite fields
• Provably secure higher-order masking of AES
• Secure computation with information leaking to an adversary
• Theory of Cryptography
• Tight private circuits: achieving probing security with the least refreshing
• Tornado: automatic generation of probing-secure masked bitsliced implementations
• Towards sound approaches to counteract power-analysis attacks
• Unifying leakage models: from probing attacks to noisy leakage.
• Verified Proofs of Higher-Order Masking

Cited in

(16)

• Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
• Security Analysis of Constructions Combining FIL Random Oracles
• Exploiting algebraic structures in probing security
• How to stretch random functions: The security of protected counter sums
• Unifying freedom and separation for tight probing-secure composition
• The random fault model
• Side-channel masking with pseudo-random generator
• On the power of expansion: more efficient constructions in the random probing model
• Randomness complexity of private circuits for multiplication
• Towards tight random probing security
• Dynamic random probing expansion with quasi linear asymptotic complexity
• From random probing to noisy leakages without field-size dependence
• Verifiable Obtained Random Subsets for Improving SPHINCS+
• Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
• Tight private circuits: achieving probing security with the least refreshing
• Security Against Related Randomness Attacks via Reconstructive Extractors

This page was built for publication: Random probing security: verification, composition, expansion and new constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096491)