Verified Proofs of Higher-Order Masking
From MaRDI portal
Recommendations
- Fast verification of masking schemes in characteristic two
- Very high order masking: efficient implementation and security evaluation
- Making Masking Security Proofs Concrete
- Higher-order masking schemes for S-boxes
- Provably secure higher-order masking of AES
- Masking proofs are tight and how to exploit it in security evaluations
- Vectorizing higher-order masking
- scientific article; zbMATH DE number 1744962
Cited in
(30)- Formal verification of side-channel countermeasures via elementary circuit transformations
- Statistical properties of side-channel and fault injection attacks using coding theory
- Side-channel masking with pseudo-random generator
- Fast verification of masking schemes in characteristic two
- Random probing security: verification, composition, expansion and new constructions
- Proving SIFA protection of masked redundant circuits
- SILVER -- statistical independence and leakage verification
- Cryptanalysis of masked ciphers: a not so random idea
- Optimal First-Order Masking with Linear and Non-linear Bijections
- Making Masking Security Proofs Concrete
- Security evaluation against side-channel analysis at compilation time
- Vectorizing higher-order masking
- Compositional Synthesis of Leakage Resilient Programs
- Detecting flawed masking schemes with leakage detection tests
- Very high order masking: efficient implementation and security evaluation
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- How fast can higher-order masking be in software?
- \textsc{SCInfer}: refinement-based verification of software countermeasures against side-channel attacks
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- Handcrafting: improving automated masking in hardware with manual optimizations
- Combined fault and leakage resilience: composability, constructions and compiler
- Secure and efficient software masking on superscalar pipelined processors
- Masking the GLP lattice-based signature scheme at any order
- Unifying freedom and separation for tight probing-secure composition
- Formal verification of arithmetic masking in hardware and software
- Automated verification of correctness for masked arithmetic programs
- INDIANA -- verifying (random) probing security through indistinguishability analysis
- PERSEUS -- Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling
- PaCMan. \underline{Pa}rtition-\underline{C}ode \underline{Ma}sking for combi\underline{n}ed security
- Correlation power analysis and higher-order masking implementation of WAGE
This page was built for publication: Verified Proofs of Higher-Order Masking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948340)
