Masking proofs are tight and how to exploit it in security evaluations
From MaRDI portal
Publication:1648843
DOI10.1007/978-3-319-78375-8_13zbMATH Open1428.94075OpenAlexW2592002982WikidataQ58764858 ScholiaQ58764858MaRDI QIDQ1648843FDOQ1648843
Authors: Vincent Grosso, François-Xavier Standaert
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_13
Recommendations
- Masking against Side-Channel Attacks: A Formal Security Proof
- Provable secure software masking in the real-world
- Making Masking Security Proofs Concrete
- Selected Areas in Cryptography
- On the practical security of a leakage resilient masking scheme
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Synthesis of masking countermeasures against side channel attacks
- Quantitative Verification of Masked Arithmetic Programs Against Side-Channel Attacks
Cited In (21)
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- Masking against Side-Channel Attacks: A Formal Security Proof
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- Security evaluation against side-channel analysis at compilation time
- Detecting flawed masking schemes with leakage detection tests
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Verified Proofs of Higher-Order Masking
- Vectorizing higher-order masking
- Fast verification of masking schemes in characteristic two
- 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
- Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking
- On the computational soundness of cryptographically masked flows
- Leakage certification made simple
- Making Masking Security Proofs Concrete
- Packed multiplication: how to amortize the cost of side-channel masking?
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- Tight private circuits: achieving probing security with the least refreshing
- On the worst-case side-channel security of ECC point randomization in embedded devices
- On the simplicity of converting leakages from multivariate to univariate. (Case study of a glitch-resistant masking scheme)
This page was built for publication: Masking proofs are tight and how to exploit it in security evaluations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648843)