Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
type: Item
instance of: scholarly article
title: Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
zbMATH Open document ID: 1326.94084
DOI: 10.1007/978-3-662-46803-6_5
author: Dana Dachman-Soled
author: Feng-Hao Liu
author: Hong-Sheng Zhou
published in: Advances in Cryptology - EUROCRYPT 2015
publication date: 2015-09-30T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6487816
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-662-46803-6 5
OpenAlex ID: W801473856
Recommended article: Leakage-Resilient Circuits without Computational Assumptions
Recommended article: Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Recommended article: Protecting Circuits from Computationally Bounded and Noisy Leakage
Recommended article: Efficient Leakage Resilient Circuit Compilers
Recommended article: Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
Recommended article: Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
Recommended article: Parallel Repetition for Leakage Resilience Amplification Revisited
Recommended article: Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Recommended article: On the leakage of corrupted garbled circuits
description: scientific article; zbMATH DE number 6487816