Unifying leakage models: from probing attacks to noisy leakage
From MaRDI portal
Publication:1715856
DOI10.1007/s00145-018-9284-1zbMath1435.94128OpenAlexW2806589823WikidataQ99672844 ScholiaQ99672844MaRDI QIDQ1715856
Sebastian Faust, Stefan Dziembowski, Alexandre Duc
Publication date: 29 January 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9284-1
Related Items (2)
Towards tight random probing security ⋮ The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions
- Leakage-Resilient Circuits without Computational Assumptions
- How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
- Noisy Leakage Revisited
- The World Is Not Enough: Another Look on Second-Order DPA
- Higher-Order Glitches Free Implementation of the AES Using Secure Multi-party Computation Protocols
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Adaptive Chosen-Message Side-Channel Attacks
- Protecting Cryptographic Keys against Continual Leakage
- Securing Computation against Continuous Leakage
- Analysis and Improvement of the Random Delay Countermeasure of CHES 2009
- Provably Secure Higher-Order Masking of AES
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Signature Schemes with Bounded Leakage Resilience
- Higher-Order Masking Schemes for S-Boxes
- Masking against Side-Channel Attacks: A Formal Security Proof
- Towards sound approaches to counteract power-analysis attacks
- Power Analysis Attacks
- Secure computation with information leaking to an adversary
- Advances in Cryptology - CRYPTO 2003
- Fast Software Encryption
- Selected Areas in Cryptography
- Shielding circuits with groups
- Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
- Public-Key Cryptosystems Resilient to Key Leakage
- Concentration of Measure for the Analysis of Randomized Algorithms
- Theory of Cryptography
This page was built for publication: Unifying leakage models: from probing attacks to noisy leakage
