Randomness complexity of private circuits for multiplication

DOI10.1007/978-3-662-49896-5_22MaRDI QIDQ5739217zbMATH OpenOpenAlexFDO

Authors Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud

Publication date 15 July 2016

Published in Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49896-5_22

zbMATH Keywords

algorithmic toolconstructionsinformation set decodinglower boundsprobabilistic methodprobing modelrandomness complexityside-channel analysis

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Private multiplication over finite fields
• Amortizing randomness complexity in private circuits
• Towards tight random probing security
• Random probing security: verification, composition, expansion and new constructions
• Reducing randomness complexity of mask refreshing algorithm

Cited in

(26)

• Circuit size relative to pseudorandom oracles
• Private multiplication over finite fields
• Side-channel masking with pseudo-random generator
• Fast verification of masking schemes in characteristic two
• On the power of expansion: more efficient constructions in the random probing model
• Custom instruction support for modular defense against side-channel and fault attacks
• Private circuits with quasilinear randomness
• Amortizing randomness complexity in private circuits
• Packed multiplication: how to amortize the cost of side-channel masking?
• Computing OR on a randomized fixed adversary CRCW PRAM
• Reducing randomness complexity of mask refreshing algorithm
• Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
• Randomness in Private Computations
• Private Computations over the Integers
• Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
• Unconditionally secure computation against low-complexity leakage
• Correction to: ``Unconditionally secure computation against low-complexity leakage
• Effective and efficient masking with low noise using small-Mersenne-prime ciphers
• Dynamic random probing expansion with quasi linear asymptotic complexity
• Unifying freedom and separation for tight probing-secure composition
• Automated verification of correctness for masked arithmetic programs
• Exploiting algebraic structures in probing security
• ProverNG: efficient verification of compositional masking for cryptosystem's side-channel security
• Tighter security notions for a modular approach to private circuits
• From arithmetic to Shamir: secure and efficient masking gadgets for multiplications. Applications to the post-quantum signature scheme MQOM
• \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Randomness complexity of private circuits for multiplication

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