From random probing to noisy leakages without field-size dependence
From MaRDI portal
(Redirected from Publication:6637530)
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- Circuit compilers with O(1/ (n)) leakage rate
- Dynamic random probing expansion with quasi linear asymptotic complexity
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- How to securely compute with noisy leakage in quasilinear complexity
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Indistinguishability Amplification
- 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
- Noisy leakage revisited
- On the power of expansion: more efficient constructions in the random probing model
- Private circuits: a modular approach
- Secure computation with information leaking to an adversary
- Side-channel masking with pseudo-random generator
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- 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.
Cited in
(5)- Removing the field size loss from Duc et al.'s conjectured bound for masked encodings
- The random fault model
- Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking
- Improved reductions from noisy to bounded and probing leakages via hockey-stick divergences
- On the security of linear secret sharing with general noisy side-channel leakage
This page was built for publication: From random probing to noisy leakages without field-size dependence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637530)