Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking
From MaRDI portal
(Redirected from Publication:6637529)
Recommendations
- Generalized Feistel ciphers for efficient prime field masking
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- From random probing to noisy leakages without field-size dependence
- Masking and leakage-resilient primitives: one, the other(s) or both?
- Unifying leakage models: from probing attacks to noisy leakage
Cites work
- Adaptive chosen-message side-channel attacks
- Advances in Cryptology - CRYPTO 2003
- Asymptotic Methods in Enumeration
- Circuit compilers with O(1/ (n)) leakage rate
- Concentration inequalities. A nonasymptotic theory of independence
- Constructing locally leakage-resilient linear secret-sharing schemes
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- scientific article; zbMATH DE number 1504808 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
- Making Masking Security Proofs Concrete
- Masking against Side-Channel Attacks: A Formal Security Proof
- Masking proofs are tight and how to exploit it in security evaluations
- Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle
- On the local leakage resilience of linear secret sharing schemes
- On the local leakage resilience of linear secret sharing schemes
- Optimal amplification of noisy leakages
- Power Analysis Attacks
- Probabilities on a Compact Group
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- Removing the field size loss from Duc et al.'s conjectured bound for masked encodings
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Statistical Analysis of Second Order Differential Power Analysis
- Tight estimate of the local leakage resilience of the additive secret-sharing scheme \& its consequences
- Towards sound approaches to counteract power-analysis attacks
- Unifying leakage models on a Rényi day
- Unifying leakage models: from probing attacks to noisy leakage.
Cited in
(6)- Generalized Feistel ciphers for efficient prime field masking
- IP masking with generic security guarantees under minimum assumptions, and applications
- Physical-bit leakage resilience of linear code-based secret sharing
- New tight bounds on the local leakage resilience of the additive (n, n)-threshold scheme determined by the eigenvalues of circulant matrices
- Leakage-resilience of Shamir's secret sharing: identifying secure evaluation places
- On the security of linear secret sharing with general noisy side-channel leakage
This page was built for publication: Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637529)
