Classical leakage resilience from fault-tolerant quantum computation
From MaRDI portal
Publication:2010581
DOI10.1007/S00145-019-09310-6zbMATH Open1435.94163arXiv1404.7516OpenAlexW2968987300MaRDI QIDQ2010581FDOQ2010581
Authors: Felipe G. Lacerda, J. M. Renes, R. Renner 
Publication date: 27 November 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1404.7516
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
- Multiple-particle interference and quantum error correction
- Quantum accuracy threshold for concatenated distance-3 code
- Reliable quantum computers
- Title not available (Why is that?)
- Leakage-Resilient Circuits without Computational Assumptions
- Theory of Cryptography
- Title not available (Why is that?)
- Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions
- How to Compute in the Presence of Leakage
- Advances in Cryptology - CRYPTO 2003
- Effective Fault-Tolerant Quantum Computation with Slow Measurements
- The Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation
- Secure multi-party quantum computation
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Title not available (Why is that?)
- Securing computation against continuous leakage
- Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis
- Program Obfuscation with Leaky Hardware
- From Indifferentiability to Constructive Cryptography (and Back)
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)
