Classical leakage resilience from fault-tolerant quantum computation
From MaRDI portal
Publication:2010581
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.
Recommendations
- Leakage-resilient circuits without computational assumptions
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Fault-tolerant quantum computation for local leakage faults
- Protecting circuits from computationally bounded and noisy leakage
- Unconditionally secure computation against low-complexity leakage
Cites work
- scientific article; zbMATH DE number 5863326 (Why is no real title available?)
- scientific article; zbMATH DE number 3692653 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Effective fault-tolerant quantum computation with slow measurements
- From Indifferentiability to Constructive Cryptography (and Back)
- How to Compute in the Presence of Leakage
- Leakage-resilient circuits without computational assumptions
- Leakage-resilient symmetric cryptography under empirically verifiable assumptions
- Multiple-particle interference and quantum error correction
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Program obfuscation with leaky hardware
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Quantum accuracy threshold for concatenated distance-3 code
- RSA key extraction via low-bandwidth acoustic cryptanalysis
- Reliable quantum computers
- Secure multi-party quantum computation
- Securing computation against continuous leakage
- The Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation
- Theory of Cryptography
Cited in
(2)
This page was built for publication: Classical leakage resilience from fault-tolerant quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010581)
