Leakage-resilient circuits against \textsf{NC1}, revisited
From MaRDI portal
Publication:6862758
Cites work
- Advances in Cryptology - CRYPTO 2003
- Boolean complexity classes vs. their arithmetic analogs
- Fine-Grained Cryptography
- Fine-grained cryptography revisited
- How to compute under \({\mathcal{AC}}^{0}\) leakage without secure hardware
- How to construct a leakage-resilient (stateless) trusted party
- scientific article; zbMATH DE number 7829258 (Why is no real title available?)
- Iterated group products and leakage resilience against \(\mathrm{NC}^1\)
- Leakage-tolerant circuits
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Non-interactive zero-knowledge proofs with fine-grained security
- On uniform circuit complexity
- Overcoming the hole in the bucket: public-key cryptography resilient to continual memory leakage
- Protecting circuits from computationally bounded and noisy leakage
- Shielding circuits with groups
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Theory of Cryptography
- Unconditionally secure computation against low-complexity leakage
- Unifying leakage models: from probing attacks to noisy leakage
This page was built for publication: Leakage-resilient circuits against \textsf{NC1}, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862758)
