Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Error Correction in the Bounded Storage Model

Yan Zong Ding

Published Jan 1, 2005• 18 citations
Publisher
DOI
10.1007/978-3-540-30576-7_31

Related papers

Simple Schemes in the Bounded Storage Model

Jiaxin Guan, Mark Zhandary

Lecture notes in computer science•Jan 1, 2019•17 citations

Error-tolerant oblivious transfer in the noisy-storage model

Cosmo Lupo, James T. Peat, Erika Andersson +1 more

The noisy-storage model of quantum cryptography allows for information-theoretically secure two-party computation based on the assumption that a cheating user has at most access to an imperfect, noisy quantum memory, whereas the honest users do not need a quantum memory at all. In general, the more noisy the quantum memory of the cheating user, the more secure the implementation of oblivious transfer, which is a primitive that allows universal secure two-party and multiparty computation. For experimental implementations of oblivious transfer, one has to consider that also the devices held by the honest users are lossy and noisy, and error correction needs to be applied to correct these trusted errors. The latter are expected to reduce the security of the protocol, since a cheating user may hide themselves in the trusted noise. Here we leverage entropic uncertainty relations to derive tight bounds on the security of oblivious transfer with a trusted and untrusted noise. In particular, we discuss noisy storage and bounded storage, with independent and correlated noise.

arXiv:2302.04236•Physical Review Research•Sep 7, 2023•8 citations

Emerging Paradigms in Quantum Error Correction and Quantum Cryptography

Prabha Mandayam Doddamane

We study two novel paradigms in quantum error correction and quantum cryptography — approximate quantum error correction and noisy-storage cryptography — which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisy-storage cryptography relies on the power of quantum noise to execute two-party cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, near-optimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worst-case fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisy-storage cryptography envisions a setting where two-party cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct two-party protocols (using higher-dimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisy-storage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the min-entropy, which are tight for specific instances of our construction.

•Jun 1, 2011•0 citations

Oblivious Transfer in the Bounded Storage Model

Yan Zong Ding

Lecture notes in computer science•Jan 1, 2001•50 citations

Continuous-variable quantum key distribution with composable security and tight error-correction bound towards constrained-device implementations

Anonymous, Carlo Ottaviani, Stefano Pirandola +2 more

Constrained devices, such as smart sensors, wearable devices, and Internet of Things nodes, are increasingly prevalent in society and rely on secure communications to function properly. These devices often operate autonomously, exchanging sensitive data or commands over short distances, such as within a room, house, or warehouse. In this context, continuous-variable quantum key distribution (CV-QKD) offers the highest secure key rate and the greatest versatility for integration into existing infrastructure. A key challenge in this setting, where devices have limited storage and processing capacity, is obtaining a realistic and tight estimate of the CV-QKD secure key rate within a composable security framework, with error correction (EC) consuming most of the storage and computational power. To address this, we focus on low-density parity-check codes with nonbinary alphabets, which optimize mutual information and are particularly suited for short-distance communications. We develop a security framework to derive finite-size secret keys near the optimal EC leakage limit and model the related memory requirements for the encoding process in one-way error correction. This analysis facilitates the practical deployment of CV-QKD, particularly in constrained devices with limited storage and computational resources.

arXiv:2504.06384•Physical Review A•Jul 13, 2026•1 citation

Optimal Randomizer Efficiency in the Bounded-Storage Model

Stefan Dziembowski, Ueli M. Maurer

Journal of Cryptology•Nov 26, 2003•55 citations
The noisy-storage model of quantum cryptography allows for information-theoretically secure two-party computation based on the assumption that a cheating user has at most access to an imperfect, noisy quantum memory, whereas the honest users do not need a quantum memory at all. In general, the more noisy the quantum memory of the cheating user, the more secure the implementation of oblivious transfer, which is a primitive that allows universal secure two-party and multiparty computation. For experimental implementations of oblivious transfer, one has to consider that also the devices held by the honest users are lossy and noisy, and error correction needs to be applied to correct these trusted errors. The latter are expected to reduce the security of the protocol, since a cheating user may hide themselves in the trusted noise. Here we leverage entropic uncertainty relations to derive tight bounds on the security of oblivious transfer with a trusted and untrusted noise. In particular, we discuss noisy storage and bounded storage, with independent and correlated noise.
We study two novel paradigms in quantum error correction and quantum cryptography — approximate quantum error correction and noisy-storage cryptography — which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisy-storage cryptography relies on the power of quantum noise to execute two-party cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, near-optimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worst-case fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisy-storage cryptography envisions a setting where two-party cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct two-party protocols (using higher-dimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisy-storage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the min-entropy, which are tight for specific instances of our construction.
Constrained devices, such as smart sensors, wearable devices, and Internet of Things nodes, are increasingly prevalent in society and rely on secure communications to function properly. These devices often operate autonomously, exchanging sensitive data or commands over short distances, such as within a room, house, or warehouse. In this context, continuous-variable quantum key distribution (CV-QKD) offers the highest secure key rate and the greatest versatility for integration into existing infrastructure. A key challenge in this setting, where devices have limited storage and processing capacity, is obtaining a realistic and tight estimate of the CV-QKD secure key rate within a composable security framework, with error correction (EC) consuming most of the storage and computational power. To address this, we focus on low-density parity-check codes with nonbinary alphabets, which optimize mutual information and are particularly suited for short-distance communications. We develop a security framework to derive finite-size secret keys near the optimal EC leakage limit and model the related memory requirements for the encoding process in one-way error correction. This analysis facilitates the practical deployment of CV-QKD, particularly in constrained devices with limited storage and computational resources.