Masked circuit compiler in the cardinal random probing composability framework

DOI10.1007/978-981-95-5096-8_12MaRDI QIDQ6834080zbMATH OpenFDO

Authors Sonia Belaïd, Victor Normand, Matthieu Rivain

Publication date 31 March 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5096-8_12

zbMATH Keywords

maskingrandom probing modelsecure composition

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Advances in Cryptology - CRYPTO 2003
• Circuit compilers with O(1/ (n)) leakage rate
• Dynamic random probing expansion with quasi linear asymptotic complexity
• Horizontal side-channel attacks and countermeasures on the ISW masking scheme
• How to securely compute with noisy leakage in quasilinear complexity
• Masking against Side-Channel Attacks: A Formal Security Proof
• New techniques for random probing security and application to Raccoon signature scheme
• On the power of expansion: more efficient constructions in the random probing model
• Private circuits: a modular approach
• Raccoon: a masking-friendly signature proven in the probing model
• Random probing security: verification, composition, expansion and new constructions
• Secure computation with information leaking to an adversary
• Simple refreshing in the noisy leakage model
• Towards tight random probing security
• Unifying leakage models: from probing attacks to noisy leakage.

Cited in

(1)

• PERSEUS -- Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling

This page was built for publication: Masked circuit compiler in the cardinal random probing composability framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834080)