How to securely compute with noisy leakage in quasilinear complexity

DOI10.1007/978-3-030-03329-3_19zbMath1446.94131OpenAlexW2730839165MaRDI QIDQ1710615

Matthieu Rivain, Dahmun Goudarzi, Antoine Joux

Publication date: 23 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-03329-3_19

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Towards tight random probing security ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Unifying freedom and separation for tight probing-secure composition

This page was built for publication: How to securely compute with noisy leakage in quasilinear complexity