Correction to: ``Unconditionally secure computation against low-complexity leakage

DOI10.1007/s00145-021-09417-9OpenAlexW4221025666MaRDI QIDQ5925544

Akshayaram Srinivasan, Yuval Ishai, Andrej Bogdanov

Publication date: 3 March 2022

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-021-09417-9

zbMATH Keywords

\(\mathsf{AC}^0\) leakageleakage-resilient circuit compilersunconditional construction

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• Private circuits: a modular approach
• How to construct a leakage-resilient (stateless) trusted party
• Horizontal side-channel attacks and countermeasures on the ISW masking scheme
• Amortizing randomness complexity in private circuits
• Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
• Bounded Indistinguishability and the Complexity of Recovering Secrets
• Secure Computation against Adaptive Auxiliary Information
• Leakage-Tolerant Computation with Input-Independent Preprocessing
• Leakage-Resilient Circuits without Computational Assumptions
• Leakage-Tolerant Interactive Protocols
• How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
• Higher-Order Side Channel Security and Mask Refreshing
• Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
• Noisy Leakage Revisited
• Candidate weak pseudorandom functions in AC ⁰ ○ MOD ₂
• Iterated group products and leakage resilience against NC1
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Protecting Cryptographic Keys against Continual Leakage
• Securing Computation against Continuous Leakage
• Provably Secure Higher-Order Masking of AES
• Protecting Circuits from Computationally Bounded and Noisy Leakage
• On the Correlation of Parity and Small-Depth Circuits
• Leakage-Resilient Zero Knowledge
• Quantum algorithms and approximating polynomials for composed functions with shared inputs
• Multiparty computation secure against continual memory leakage
• Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
• Higher Order Masking of Look-Up Tables
• Secure computation with information leaking to an adversary
• Advances in Cryptology - CRYPTO 2003
• Shielding circuits with groups
• Randomness Complexity of Private Circuits for Multiplication
• Theory of Cryptography
• On the local leakage resilience of linear secret sharing schemes
• Unconditionally secure computation against low-complexity leakage

This page was built for publication: Correction to: ``Unconditionally secure computation against low-complexity leakage