Unconditionally secure computation against low-complexity leakage

DOI10.1007/978-3-030-26951-7_14zbMath1506.68030OpenAlexW2967973319MaRDI QIDQ5919497

Andrej Bogdanov, Akshayaram Srinivasan, Yuval Ishai

Publication date: 9 March 2020

Published in: Advances in Cryptology – CRYPTO 2019 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_14

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)

Related Items (5)

Constructing locally leakage-resilient linear secret-sharing schemes ⋮ Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family ⋮ Unnamed Item ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages

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