Exploiting algebraic structures in probing security

DOI10.1007/978-981-99-8730-6_8zbMATH Open1547.94405MaRDI QIDQ6604876FDOQ6604876

Authors: Maxime Plançon 

Publication date: 13 September 2024

Recommendations

• Unifying freedom and separation for tight probing-secure composition
• Tight private circuits: achieving probing security with the least refreshing
• Algebraic decomposition for probing security
• Towards tight random probing security
• Obfuscating circuits via composite-order graded encoding

zbMATH Keywords

maskingmultiplication gadgetrefresh gadgetRTIK

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
• Title not available (Why is that?)
• Randomness complexity of private circuits for multiplication
• Advances in Cryptology - CRYPTO 2003
• Provably secure higher-order masking of AES
• Private circuits: a modular approach
• Horizontal side-channel attacks and countermeasures on the ISW masking scheme
• Higher-order side channel security and mask refreshing
• Masking against Side-Channel Attacks: A Formal Security Proof
• Unifying leakage models: from probing attacks to noisy leakage.
• Random probing security: verification, composition, expansion and new constructions
• NTRU prime: reducing attack surface at low cost
• Private multiplication over finite fields
• How to securely compute with noisy leakage in quasilinear complexity
• Noisy leakage revisited
• Circuit compilers with \(O(1/\log (n))\) leakage rate
• On the power of expansion: more efficient constructions in the random probing model
• Dynamic random probing expansion with quasi linear asymptotic complexity

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)