How to construct a leakage-resilient (stateless) trusted party

DOI10.1007/978-3-319-70503-3_7zbMath1412.94176OpenAlexW2766825861MaRDI QIDQ1690270

Daniel Genkin, Yuval Ishai, Mor Weiss

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_7

zbMATH Keywords

secure multiparty computationalgebraic manipulation detectionleakage-resilienceAMD circuits

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

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

This page was built for publication: How to construct a leakage-resilient (stateless) trusted party