The following pages link to Sonia Belaïd (Q892290):
Displaying 16 items.
- Masking and leakage-resilient primitives: one, the other(s) or both? (Q892292) (← links)
- Masking the GLP lattice-based signature scheme at any order (Q1648842) (← links)
- Private multiplication over finite fields (Q1675211) (← links)
- Improved side-channel analysis of finite-field multiplication (Q1695890) (← links)
- Tight private circuits: achieving probing security with the least refreshing (Q1710603) (← links)
- Tornado: automatic generation of probing-secure masked bitsliced implementations (Q2055659) (← links)
- On the power of expansion: more efficient constructions in the random probing model (Q2056735) (← links)
- Random probing security: verification, composition, expansion and new constructions (Q2096491) (← links)
- Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks (Q2794524) (← links)
- Leakage-Resilient Symmetric Encryption via Re-keying (Q2851428) (← links)
- Side-Channel Analysis of Multiplications in GF(2128) (Q2936615) (← links)
- Verified Proofs of Higher-Order Masking (Q2948340) (← links)
- Randomness Complexity of Private Circuits for Multiplication (Q5739217) (← links)
- Dynamic random probing expansion with quasi linear asymptotic complexity (Q6157515) (← links)
- Masking the GLP lattice-based signature scheme at any order (Q6182002) (← links)
- Unifying freedom and separation for tight probing-secure composition (Q6186765) (← links)