Sciweavers

Share
IACR
2016

Circuit Compilers with O(1/ log(n)) Leakage Rate

5 years 6 months ago
Circuit Compilers with O(1/ log(n)) Leakage Rate
The goal of leakage-resilient cryptography is to construct cryptographic algorithms that are secure even if the devices on which they are implemented leak information to the adversary. One of the main parameters for designing leakage resilient constructions is the leakage rate, i.e., a proportion between the amount of leaked information and the complexity of the computation carried out by the construction. We focus on the so-called circuit compilers, which is an important tool for transforming any cryptographic algorithm (represented as a circuit) into one that is secure against the leakage attack. Our model is the “probing attack” where the adversary learns the values on some (chosen by him) wires of the circuit. Our results can be summarized as follows. First, we construct circuit compilers with perfect security and leakage rate O(1/ log(n)), where n denotes the security parameter (previously known constructions achieved rate O(1/n)). Moreover, for the circuits that have only a...
Marcin Andrychowicz, Stefan Dziembowski, Sebastian
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where IACR
Authors Marcin Andrychowicz, Stefan Dziembowski, Sebastian Faust
Comments (0)
books