Randomness Complexity of Private Circuits for Multiplication
From MaRDI portal
Publication:5739217
DOI10.1007/978-3-662-49896-5_22zbMath1371.94624OpenAlexW2418954816MaRDI QIDQ5739217
Damien Vergnaud, Sonia Belaïd, Emmanuel Prouff, Adrian Thillard, Alain Passelègue, Fabrice Benhamouda
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
constructionslower boundsprobabilistic methodside-channel analysisrandomness complexityalgorithmic toolinformation set decodingprobing model
Related Items (15)
\textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations ⋮ Private circuits with quasilinear randomness ⋮ 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 ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Reducing Randomness Complexity of Mask Refreshing Algorithm ⋮ Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison ⋮ 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 ⋮ 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
Uses Software
This page was built for publication: Randomness Complexity of Private Circuits for Multiplication
