Pages that link to "Item:Q4924408"
From MaRDI portal
The following pages link to Masking against Side-Channel Attacks: A Formal Security Proof (Q4924408):
Displaying 50 items.
- Masking and leakage-resilient primitives: one, the other(s) or both? (Q892292) (← links)
- Novel leakage against realistic masking and shuffling countermeasures -- case study on PRINCE and SEED (Q1642445) (← links)
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data (Q1648801) (← links)
- Masking proofs are tight and how to exploit it in security evaluations (Q1648843) (← links)
- Formal verification of side-channel countermeasures via elementary circuit transformations (Q1656021) (← links)
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme (Q1695964) (← links)
- Unifying leakage models: from probing attacks to noisy leakage (Q1715856) (← links)
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version (Q2010587) (← links)
- Tornado: automatic generation of probing-secure masked bitsliced implementations (Q2055659) (← links)
- Fast verification of masking schemes in characteristic two (Q2056733) (← links)
- On the power of expansion: more efficient constructions in the random probing model (Q2056735) (← links)
- The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free (Q2056741) (← links)
- Random probing security: verification, composition, expansion and new constructions (Q2096491) (← links)
- Towards tight random probing security (Q2128995) (← links)
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities (Q2424888) (← links)
- KVaC: key-value commitments for blockchains and beyond (Q2691607) (← links)
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption (Q2692358) (← links)
- SILVER -- statistical independence and leakage verification (Q2692368) (← links)
- Packed multiplication: how to amortize the cost of side-channel masking? (Q2692370) (← links)
- Efficient Leakage Resilient Circuit Compilers (Q2790050) (← links)
- Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks (Q2794524) (← links)
- Optimal Amplification of Noisy Leakages (Q2799099) (← links)
- Polynomial Evaluation and Side Channel Analysis (Q2803637) (← links)
- Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
- Making Masking Security Proofs Concrete (Q2948337) (← links)
- A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage (Q2953822) (← links)
- Affine Masking against Higher-Order Side Channel Analysis (Q3084260) (← links)
- On the computational soundness of cryptographically masked flows (Q3189852) (← links)
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison (Q3297548) (← links)
- Vectorizing Higher-Order Masking (Q3297549) (← links)
- Compositional Synthesis of Leakage Resilient Programs (Q3304821) (← links)
- Secure Computation from Leaky Correlated Randomness (Q3457091) (← links)
- Algebraic Decomposition for Probing Security (Q3457137) (← links)
- Маскирование ГОСТ 28147-89 для защиты от атак по побочным каналам (Q5152388) (← links)
- Selected Areas in Cryptography (Q5491740) (← links)
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model (Q5738889) (← links)
- How Fast Can Higher-Order Masking Be in Software? (Q5738890) (← links)
- Revisiting mutual information analysis: multidimensionality, neural estimation and optimality proofs (Q6054729) (← links)
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers (Q6061536) (← links)
- Systematic study of decryption and re-encryption leakage: the case of Kyber (Q6086403) (← links)
- Secret can be public: low-memory AEAD mode for high-order masking (Q6108985) (← links)
- Analyzing masked ciphers against transition and coupling effects (Q6157583) (← links)
- Exploiting algebraic structures in probing security (Q6604876) (← links)
- Mask compression: high-order masking on memory-constrained devices (Q6620034) (← links)
- Generalized Feistel ciphers for efficient prime field masking (Q6637329) (← links)
- Leakage-tolerant circuits (Q6637525) (← links)
- Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking (Q6637529) (← links)
- From random probing to noisy leakages without field-size dependence (Q6637530) (← links)
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing (Q6652995) (← links)
- Leakage certification made simple (Q6652997) (← links)
