Random probing security: verification, composition, expansion and new constructions
From MaRDI portal
Publication:2096491
DOI10.1007/978-3-030-56784-2_12zbMath1503.94024OpenAlexW3046514168MaRDI QIDQ2096491
Matthieu Rivain, Sonia Belaïd, Emmanuel Prouff, Abdul Rahman Taleb, Jean-Sébastien Coron
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_12
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Related Items (5)
Towards tight random 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 ⋮ Unifying freedom and separation for tight probing-secure composition ⋮ On the power of expansion: more efficient constructions in the random probing model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Private circuits: a modular approach
- Formal verification of side-channel countermeasures via elementary circuit transformations
- Private multiplication over finite fields
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- Tight private circuits: achieving probing security with the least refreshing
- Player simulation and general adversary structures in perfect multiparty computation
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae
- Higher-Order Side Channel Security and Mask Refreshing
- Verified Proofs of Higher-Order Masking
- 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.
- 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
- Theory of Cryptography
This page was built for publication: Random probing security: verification, composition, expansion and new constructions
