Efficient leakage resilient circuit compilers

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Marcin Andrychowicz, University of Warsaw
  • ,
  • Ivan Bjerre Damgård
  • Stefan Dziembowski, University of Warsaw
  • ,
  • Sebastian Faust, École Polytechnique Fédérale de Lausanne
  • ,
  • Antigoni Polychroniadou

In this paper, we revisit the problem of constructing general leakage resilient compilers that can transform any (Boolean) circuit C into a protected circuit C′ computing the same functionality as C, which additionally is resilient to certain classes of leakage functions. An important problem that has been neglected in most works on leakage resilient circuits is to minimize the overhead induced by the compiler. In particular, in earlier works for a circuit C of size s, the transformed circuit C′ has size at least O(sk<sup>2</sup>), where k is the security parameter. In this work, using techniques from secure Multi-Party Computation, we show that in important leakage models such as bounded independent leakage and leakage from weak complexity classes the size of the transformed circuit can be reduced to O(sk).

Original languageEnglish
Title of host publicationTopics in Cryptology - CT-RSA 2015 : The Cryptographer's Track at the RSA Conference 2015, San Francisco, CA, USA, April 20-24, 2015. Proceedings
EditorsKaisa Nyberg
Number of pages19
PublisherSpringer VS
Publication year2015
Pages311-329
ISBN (print)9783319167145
ISBN (Electronic)978-3-319-16715-2
DOIs
Publication statusPublished - 2015
EventRSA Conference Cryptographers’ Track, CT-RSA 2015 - San Francisco, United States
Duration: 21 Apr 201524 Apr 2015

Conference

ConferenceRSA Conference Cryptographers’ Track, CT-RSA 2015
LandUnited States
BySan Francisco
Periode21/04/201524/04/2015
SeriesLecture Notes in Computer Science
Volume9048
ISSN0302-9743

See relations at Aarhus University Citationformats

ID: 93414353