Recommendations
- Private circuits: a modular approach
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Unconditionally secure computation against low-complexity leakage
- Unconditionally secure computation against low-complexity leakage
- Protecting circuits from computationally bounded and noisy leakage
Cites work
- Advances in Cryptology - CRYPTO 2003
- Faster evaluation of sboxes via common shares
- Hardware Private Circuits: From Trivial Composition to Full Verification
- Higher-order side channel security and mask refreshing
- How to Compute in the Presence of Leakage
- How to compute under \({\mathcal{AC}}^{0}\) leakage without secure hardware
- How to construct a leakage-resilient (stateless) trusted party
- Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
- Leakage-resilient circuits without computational assumptions
- Masking against Side-Channel Attacks: A Formal Security Proof
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Private circuits with quasilinear randomness
- Private circuits: a modular approach
- Protecting circuits from computationally bounded and noisy leakage
- Provably secure higher-order masking of AES
- Robust pseudorandom generators
- Shielding circuits with groups
- Theory of Cryptography
- Tight private circuits: achieving probing security with the least refreshing
- Unconditionally secure computation against low-complexity leakage
- Unifying freedom and separation for tight probing-secure composition
- Unifying leakage models: from probing attacks to noisy leakage
This page was built for publication: Leakage-tolerant circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637525)
