Leakage-Resilient Circuits without Computational Assumptions
From MaRDI portal
Publication:2891486
DOI10.1007/978-3-642-28914-9_13zbMath1303.94079OpenAlexW200547771MaRDI QIDQ2891486
Sebastian Faust, Stefan Dziembowski
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_13
Related Items (18)
Signature schemes secure against hard-to-invert leakage ⋮ How to Compute in the Presence of Leakage ⋮ Impossibility of Black-Box Simulation Against Leakage Attacks ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Leakage Resilience of the Blom’s Key Distribution Scheme ⋮ Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ Unifying leakage models: from probing attacks to noisy leakage ⋮ On the Connection between Leakage Tolerance and Adaptive Security ⋮ Classical leakage resilience from fault-tolerant quantum computation ⋮ New approach to practical leakage-resilient public-key cryptography ⋮ Efficient Leakage Resilient Circuit Compilers ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice ⋮ Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits ⋮ Optimal Amplification of Noisy Leakages ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Locally decodable and updatable non-malleable codes and their applications
This page was built for publication: Leakage-Resilient Circuits without Computational Assumptions
