Private circuits: a modular approach

DOI10.1007/978-3-319-96878-0_15zbMATH Open1462.94028OpenAlexW2810622823MaRDI QIDQ775985FDOQ775985

Prabhanjan Ananth, Yuval Ishai, Amit Sahai

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)

Cited In (13)

• Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
• Tight bounds on the randomness complexity of secure multiparty computation
• Correction to: ``Unconditionally secure computation against low-complexity leakage
• Exploiting algebraic structures in probing security
• Side-channel masking with pseudo-random generator
• On the power of expansion: more efficient constructions in the random probing model
• Dynamic random probing expansion with quasi linear asymptotic complexity
• From random probing to noisy leakages without field-size dependence
• Leakage-tolerant circuits
• Random probing security: verification, composition, expansion and new constructions
• Towards tight random probing security
• Unconditionally secure computation against low-complexity leakage
• A communication-privacy tradeoff for modular addition

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

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