Private circuits: a modular approach

DOI10.1007/978-3-319-96878-0_15zbMath1462.94028OpenAlexW2810622823MaRDI QIDQ775985

Yuval Ishai, Amit Sahai, Prabhanjan V. Ananth

Publication date: 30 June 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-96878-0_15

zbMATH Keywords

leakage probabilityleakage tolerance

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20)

Related Items (9)

Towards tight random probing security ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Dynamic random probing expansion with quasi linear asymptotic complexity ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Side-channel masking with pseudo-random generator ⋮ On the power of expansion: more efficient constructions in the random probing model ⋮ Random probing security: verification, composition, expansion and new constructions

This page was built for publication: Private circuits: a modular approach