Making Masking Security Proofs Concrete
From MaRDI portal
Publication:2948337
DOI10.1007/978-3-662-46800-5_16zbMATH Open1370.94508DBLPconf/eurocrypt/DucFS15OpenAlexW2241259389WikidataQ58764999 ScholiaQ58764999MaRDI QIDQ2948337FDOQ2948337
Authors: Alexandre Duc, Sebastian Faust, François-Xavier Standaert 
Publication date: 30 September 2015
Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/207735
Recommendations
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Masking proofs are tight and how to exploit it in security evaluations
- Provable secure software masking in the real-world
- Masking against Side-Channel Attacks: A Formal Security Proof
- Selected Areas in Cryptography
- On the practical security of a leakage resilient masking scheme
- Provably secure higher-order masking of AES
- Verified Proofs of Higher-Order Masking
- Consolidating masking schemes
Cited In (33)
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- How to fool a black box machine learning based side-channel security evaluation
- Taylor expansion of maximum likelihood attacks for masked and shuffled implementations
- There is wisdom in harnessing the strengths of your enemy: customized encoding to thwart side-channel attacks
- Inner product masking revisited
- Ridge-based profiled differential power analysis
- Codes for side-channel attacks and protections
- Formal analysis of the entropy / security trade-off in first-order masking countermeasures against side-channel attacks
- Masking proofs are tight and how to exploit it in security evaluations
- Security analysis of deterministic re-keying with masking and shuffling: application to ISAP
- Leakage certification revisited: bounding model errors in side-channel security evaluations
- Score-Based vs. Probability-Based Enumeration – A Cautionary Note
- Characterisation and estimation of the key rank distribution in the context of side channel evaluations
- Mask compression: high-order masking on memory-constrained devices
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle
- Verified Proofs of Higher-Order Masking
- Masking and leakage-resilient primitives: one, the other(s) or both?
- Vectorizing higher-order masking
- Fast verification of masking schemes in characteristic two
- Towards sound fresh re-keying with hard (physical) learning problems
- Systematic study of decryption and re-encryption leakage: the case of Kyber
- Removing the field size loss from Duc et al.'s conjectured bound for masked encodings
- Generalized Feistel ciphers for efficient prime field masking
- Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking
- \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
- Improved reductions from noisy to bounded and probing leakages via hockey-stick divergences
- Bridging the gap: advanced tools for side-channel leakage estimation beyond Gaussian templates and histograms
- Optimal amplification of noisy leakages
- Conversion of security proofs from one leakage model to another: a new issue
- Differential bias attack for block cipher under randomized leakage with key enumeration
This page was built for publication: Making Masking Security Proofs Concrete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948337)
