Protecting Circuits from Computationally Bounded and Noisy Leakage
Name
Faust-2014-Protecting Circuits.pdf
Size
939.91 KB
Format
Adobe PDF
Checksum (MD5)
591c4e6e78dc804caeda6f90d7ebb585
Author(s)
Faust, Sebastian
Rabin, Tal
Reyzin, Leonid
Tromer, Eran
Vaikuntanathan, Vinod
Date Issued
September 2014
Journal
SIAM Journal on Computing
Publisher
Society for Industrial and Applied Mathematics
Citation
Faust, Sebastian, Tal Rabin, Leonid Reyzin, Eran Tromer, and Vinod Vaikuntanathan. “Protecting Circuits from Computationally Bounded and Noisy Leakage.” SIAM Journal on Computing 43, no. 5 (January 2014): 1564–1614.
Version
Final published version
Abstract
Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles any circuit into a circuit with the same functionality but resilience against well-defined classes of leakage. Our construction requires a small, stateless, and computation-independent leak-proof component that draws random elements from a fixed distribution. In essence, we reduce the problem of shielding arbitrarily complex circuits to the problem of shielding a single, simple component. Our approach is based on modeling the adversary as a powerful observer that inspects the device via a limited measurement apparatus. We allow the apparatus to access all the bits of the computation (except those inside the leak-proof component), and the amount of leaked information to grow unbounded over time. However, we assume that the apparatus is limited in the amount of output bits per iteration and the ability to decode certain linear encodings. While our results apply in general to such leakage classes, in particular, we obtain security against (a) constant-depth circuits leakage, where the leakage function is computed by an $\mathsf{AC}^0$ circuit (composed of NOT gates and unbounded fan-in AND and OR gates); (b) noisy leakage, where the leakage function reveals all the bits of the internal state of the circuit, but each bit is perturbed by independent binomial noise---i.e., flipped with some probability $p$. Namely, for some number $p\in(0,1/2]$, each bit of the computation is flipped with probability $p$, and remains unchanged with probability $1-p$.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/120880343
