Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
From MaRDI portal
Publication:6652995
Cites work
- scientific article; zbMATH DE number 1583805 (Why is no real title available?)
- scientific article; zbMATH DE number 1979272 (Why is no real title available?)
- scientific article; zbMATH DE number 1979273 (Why is no real title available?)
- scientific article; zbMATH DE number 1878336 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- scientific article; zbMATH DE number 3426581 (Why is no real title available?)
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- A formal study of power variability issues and side-channel attacks for nanoscale devices
- A theorem on the entropy of certain binary sequences and applications--I
- Advances in Cryptology - CRYPTO 2003
- An Operational Approach to Information Leakage
- Coding Theorems for Noisy Permutation Channels
- Coding for Positive Rate in the Source Model Key Agreement Problem
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Domination polynomial of the rook graph
- Dual-rail transition logic: A logic style for counteracting power analysis attacks
- Gaussian Mixture Models for Higher-Order Side Channel Analysis
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- How to securely compute with noisy leakage in quasilinear complexity
- Le cas discontinu des probabilités en chaîne.
- Leakage certification revisited: bounding model errors in side-channel security evaluations
- Making Masking Security Proofs Concrete
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Masking against Side-Channel Attacks: A Formal Security Proof
- Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient
- On the power of expansion: more efficient constructions in the random probing model
- Physical-layer security. From information theory to security engineering
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- Provably secure higher-order masking of AES
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- Random probing security: verification, composition, expansion and new constructions
- Removing the field size loss from Duc et al.'s conjectured bound for masked encodings
- Secure wire shuffling in the probing model
- Shuffling against side-channel attacks: a comprehensive study with cautionary note
- The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
- Theory of Cryptography
- Towards sound approaches to counteract power-analysis attacks
- Towards tight random probing security
- Unifying leakage models on a Rényi day
- Unifying leakage models: from probing attacks to noisy leakage
- Unifying leakage models: from probing attacks to noisy leakage.
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)
