Towards tight random probing security
From MaRDI portal
Publication:2128995
DOI10.1007/978-3-030-84252-9_7zbMath1486.94083OpenAlexW3184500914MaRDI QIDQ2128995
Maximilian Orlt, Gaëtan Cassiers, Sebastian Faust, François-Xavier Standaert
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_7
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Private circuits: a modular approach
- Formal verification of masked hardware implementations in the presence of glitches
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- How to securely compute with noisy leakage in quasilinear complexity
- Unifying leakage models: from probing attacks to noisy leakage
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Random probing security: verification, composition, expansion and new constructions
- Simple refreshing in the noisy leakage model
- Unifying leakage models on a Rényi day
- Theoretical and practical aspects of mutual information-based side channel analysis
- SILVER -- statistical independence and leakage verification
- Higher-Order Side Channel Security and Mask Refreshing
- Noisy Leakage Revisited
- Hardware Private Circuits: From Trivial Composition to Full Verification
- Masking against Side-Channel Attacks: A Formal Security Proof
- Towards sound approaches to counteract power-analysis attacks
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Secure computation with information leaking to an adversary
- Advances in Cryptology - CRYPTO 2003
- Topics in Cryptology – CT-RSA 2005
- Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
This page was built for publication: Towards tight random probing security
