Exploiting algebraic structures in probing security
From MaRDI portal
(Redirected from Publication:6604876)
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- Circuit compilers with O(1/ (n)) leakage rate
- Dynamic random probing expansion with quasi linear asymptotic complexity
- Higher-order side channel security and mask refreshing
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- How to securely compute with noisy leakage in quasilinear complexity
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Masking against Side-Channel Attacks: A Formal Security Proof
- Noisy leakage revisited
- NTRU prime: reducing attack surface at low cost
- On the power of expansion: more efficient constructions in the random probing model
- Private circuits: a modular approach
- Private multiplication over finite fields
- Provably secure higher-order masking of AES
- Random probing security: verification, composition, expansion and new constructions
- Randomness complexity of private circuits for multiplication
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Unifying leakage models: from probing attacks to noisy leakage.
This page was built for publication: Exploiting algebraic structures in probing security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604876)
