Classical leakage resilience from fault-tolerant quantum computation

TL;DR

This paper links leakage resilience in cryptography to fault-tolerant quantum computation, showing how quantum fault tolerance can be used to achieve classical leakage-resilient circuits under certain models.

Contribution

It establishes a theoretical connection between leakage resilience and fault-tolerant quantum computation, enabling new methods for secure classical circuit implementation.

Findings

Fault tolerance implies leakage resilience under a corresponding noise model.

Quantum constructions can be adapted to secure classical circuits against leakage.

The work provides a framework for leveraging quantum fault tolerance in classical security.

Abstract

Physical implementations of cryptographic algorithms leak information, which makes them vulnerable to so-called side-channel attacks. The problem of secure computation in the presence of leakage is generally known as leakage resilience. In this work, we establish a connection between leakage resilience and fault-tolerant quantum computation. We first prove that for a general leakage model, there exists a corresponding noise model in which fault tolerance implies leakage resilience. Then we show how to use constructions for fault-tolerant quantum computation to implement classical circuits that are secure in specific leakage models.