Amortizing randomness complexity in private circuits

DOI10.1007/978-3-319-70694-8_27zbMath1420.94062OpenAlexW2770222748MaRDI QIDQ2412895

Clara Paglialonga, Tobias Schneider, Sebastian Faust

Publication date: 6 April 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70694-8_27

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Secure wire shuffling in the probing model ⋮ Private circuits with quasilinear randomness ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Cryptanalysis of masked ciphers: a not so random idea ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Side-channel masking with pseudo-random generator

This page was built for publication: Amortizing randomness complexity in private circuits