Random probing security: verification, composition, expansion and new constructions
From MaRDI portal
Publication:2096491
DOI10.1007/978-3-030-56784-2_12zbMATH Open1503.94024OpenAlexW3046514168MaRDI QIDQ2096491FDOQ2096491
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
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Theory of compilers and interpreters (68N20)
Cites Work
- Title not available (Why is that?)
- Theory of Cryptography
- Player simulation and general adversary structures in perfect multiparty computation
- 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
- Verified Proofs of Higher-Order Masking
- 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.
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
- Formal verification of side-channel countermeasures via elementary circuit transformations
- Title not available (Why is that?)
- Private multiplication over finite fields
- Tight private circuits: achieving probing security with the least refreshing
- Secure computation with information leaking to an adversary
- Circuit compilers with \(O(1/\log (n))\) leakage rate
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
- Unifying freedom and separation for tight probing-secure composition
- How to stretch random functions: The security of protected counter sums
- The random fault model
- Randomness complexity of private circuits for multiplication
- Side-channel masking with pseudo-random generator
- On the power of expansion: more efficient constructions in the random probing model
- Dynamic random probing expansion with quasi linear asymptotic complexity
- From random probing to noisy leakages without field-size dependence
- Towards tight random probing security
- 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)
