Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
From MaRDI portal
Publication:6652995
DOI10.1007/978-3-031-68391-6_12MaRDI QIDQ6652995
Could not fetch data.
Publication date: 13 December 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dual-rail transition logic: A logic style for counteracting power analysis attacks
- 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
- On the power of expansion: more efficient constructions in the random probing model
- Random probing security: verification, composition, expansion and new constructions
- Towards tight random probing security
- Secure wire shuffling in the probing model
- Unifying leakage models on a Rényi day
- Leakage certification revisited: bounding model errors in side-channel security evaluations
- Le cas discontinu des probabilités en chaîne.
- Making Masking Security Proofs Concrete
- A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices
- Gaussian Mixture Models for Higher-Order Side Channel Analysis
- Provably Secure Higher-Order Masking of AES
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- A theorem on the entropy of certain binary sequences and applications--I
- Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note
- Masking against Side-Channel Attacks: A Formal Security Proof
- Towards sound approaches to counteract power-analysis attacks
- An Operational Approach to Information Leakage
- Coding for Positive Rate in the Source Model Key Agreement Problem
- Coding Theorems for Noisy Permutation Channels
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Removing the field size loss from Duc et al.'s conjectured bound for masked encodings
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
- Domination polynomial of the rook graph
This page was built for publication: Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652995)