Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
From MaRDI portal
Publication:2948381
DOI10.1007/978-3-662-46803-6_5zbMath1326.94084OpenAlexW801473856MaRDI QIDQ2948381
Dana Dachman-Soled, Feng-Hao Liu, Hong-Sheng Zhou
Publication date: 30 September 2015
Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_5
Related Items (8)
Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Survey of information security ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Leakage resilience from program obfuscation ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
This page was built for publication: Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
