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

arXiv:2012.04151 · IEEE Transactions on Information Theory

Quantum Sampling for Finite Key Rates in High Dimensional Quantum Cryptography

Keegan Yao, Walter O. Krawec, Jiadong Zhu

Published Jan 11, 2022• 22 citations
arXivHTMLPDF

Abstract

It has been shown recently that the framework of quantum sampling, as introduced by Bouman and Fehr, can lead to new entropic uncertainty relations highly applicable to finite-key cryptographic analyses. Here we revisit these so-called sampling-based entropic uncertainty relations, deriving newer, more powerful, relations and applying them to source-independent quantum random number generators and high-dimensional quantum key distribution protocols. Along the way, we prove several interesting results in the asymptotic case for our entropic uncertainty relations. These sampling-based approaches to entropic uncertainty, and their application to quantum cryptography, hold great potential for deriving proofs of security for quantum cryptographic systems, and the approaches we use here may be applicable to an even wider range of scenarios.

DOI
10.1109/tit.2022.3141874

Related papers

A New High-Dimensional Quantum Entropic Uncertainty Relation with Applications

Walter O. Krawec

In this paper we derive a new quantum entropic uncertainty relation, bounding the conditional smooth quantum min entropy based on the result of a measurement using a two outcome POVM and the failure probability of a classical sampling strategy. Our relation works for systems of arbitrary dimension. We apply it to analyze a new source independent quantum random number generation protocol and show our relation provides optimistic results compared to prior work.

arXiv:2005.04773•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•8 citations

Cryptography from quantum uncertainty in the presence of quantum side information

Niek J. Bouman

The thesis starts with a high-level introduction into cryptography and quantum mechanics. Chapter 2 gives a theoretical foundation by introducing probability theory, information theory, functional analysis, quantum mechanics and quantum information theory. Chapter 3, 4 and 5 are editions of work published earlier.\n\nIn Chapter 3, we present a quantum-information-theoretic tool to analyze random sampling in a quantum setting. In particular, we present two new rigorous security proofs that make use of our new sampling tool: one for BB84 quantum key distribution, and one for a quantum reduction from oblivious transfer (OT) to bit commitment.\n\nChapter 4 studies the problem of message authentication from a weak key (which is a key that is not uniformly random, e.g., a password) in a new scenario. In this scenario, the weak key is a one-time session key that is derived from a public source of randomness with the help of a long-term key (e.g., a password). We propose a new four-round protocol for message authentication from a weak (session) key. \n\nIn Chapter 5 we present a new entropic uncertainty relation and furthermore we consider the task of password-based identification. We devise a new quantum identification protocol that is secure in two security models simultaneously.

•Oct 1, 2008•0 citations

Entropic Uncertainty for Biased Measurements

Walter O. Krawec

Entropic Uncertainty relations are powerful tools, especially in quantum cryptography. They typically bound the amount of uncertainty a third-party adversary may hold on a measurement outcome as a result of the measurement overlap. However, when the two measurement bases are biased towards one another, standard entropic uncertainty relations do not always provide optimal lower bounds on the entropy. Here, we derive a new entropic uncertainty relation, for certain quantum states, which can provide a significantly higher bound even if the two measurement bases are no longer mutually unbiased. We evaluate our bound on two different quantum cryptographic protocols, including BB84 with faulty/biased measurement devices, and show that our new bound can produce substantially higher key-rates under several scenarios when compared with prior work using standard entropic uncertainty relations.

arXiv:2305.09753•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•5 citations

Finite Key Size Analysis of Two-Way Quantum Cryptography

Jesni Shamsul Shaari, Stefano Mancini

Quantum cryptographic protocols solve the longstanding problem of distributing a shared secret string to two distant users by typically making use of one-way quantum channel. However, alternative protocols exploiting two-way quantum channel have been proposed for the same goal and with potential advantages. Here, we overview a security proof for two-way quantum key distribution protocols, against the most general eavesdropping attack, that utilize an entropic uncertainty relation. Then, by resorting to the “smooth” version of involved entropies, we extend such a proof to the case of finite key size. The results will be compared to those available for one-way protocols showing some advantages.

arXiv:1503.01498•Entropy•Apr 30, 2015•11 citations

A Tight High-Order Entropic Quantum Uncertainty Relation With Applications

Ivan Damgaard, Serge Fehr, Renato Renner +2 more

We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1-out-of-2 Oblivious Transfer and quantum Bit Commitment are presented and the uncertainty relation is used to prove the security of these protocols in the bounded quantum-storage model according to new strong security definitions. As another application, we consider the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers. The uncertainty relation allows to prove the security of QKD protocols in this setting while tolerating considerably higher error rates compared to the standard model with unbounded adversaries. For instance, for the six-state protocol with one-way communication, a bit-flip error rate of up to 17% can be tolerated (compared to 13% in the standard model). Our uncertainty relation also yields a lower bound on the min-entropy key uncertainty against known-plaintext attacks when quantum ciphers are composed. Previously, the key uncertainty of these ciphers was only known with respect to Shannon entropy.

arXiv:quant-ph/0612014•Dec 2, 2006•14 citations

Tight finite-key analysis for generalized high-dimensional quantum key distribution

Rong Wang, Zhen-Qiang Yin, Hang Liu +4 more

Due to the capability of tolerating high error rate and generating more key bits per trial, high-dimensional quantum key distribution attracts wide interest.Despite great progresses in high-dimensional quantum key distribution, there are still some gaps between theory and experiment.One of these is that the security of the secret key heavily depends on the number of the emitted signals.So far, the existing security proofs are only suitable in the case with an infinite or unpractically large number of emitted signals.Here, by introducing the idea of "key classification" and developing relevant techniques based on the uncertainty relation for smooth entropies, we propose a tight finite-key analysis suitable for generalized high-dimensional quantum key distribution protocols.Benefitting from our theory, high-dimensional quantum key distribution protocols with finite resources become experimentally feasible.

arXiv:2008.03510•Physical Review Research•Apr 7, 2021•10 citations
It has been shown recently that the framework of quantum sampling, as introduced by Bouman and Fehr, can lead to new entropic uncertainty relations highly applicable to finite-key cryptographic analyses. Here we revisit these so-called sampling-based entropic uncertainty relations, deriving newer, more powerful, relations and applying them to source-independent quantum random number generators and high-dimensional quantum key distribution protocols. Along the way, we prove several interesting results in the asymptotic case for our entropic uncertainty relations. These sampling-based approaches to entropic uncertainty, and their application to quantum cryptography, hold great potential for deriving proofs of security for quantum cryptographic systems, and the approaches we use here may be applicable to an even wider range of scenarios.
The thesis starts with a high-level introduction into cryptography and quantum mechanics. Chapter 2 gives a theoretical foundation by introducing probability theory, information theory, functional analysis, quantum mechanics and quantum information theory. Chapter 3, 4 and 5 are editions of work published earlier.\n\nIn Chapter 3, we present a quantum-information-theoretic tool to analyze random sampling in a quantum setting. In particular, we present two new rigorous security proofs that make use of our new sampling tool: one for BB84 quantum key distribution, and one for a quantum reduction from oblivious transfer (OT) to bit commitment.\n\nChapter 4 studies the problem of message authentication from a weak key (which is a key that is not uniformly random, e.g., a password) in a new scenario. In this scenario, the weak key is a one-time session key that is derived from a public source of randomness with the help of a long-term key (e.g., a password). We propose a new four-round protocol for message authentication from a weak (session) key. \n\nIn Chapter 5 we present a new entropic uncertainty relation and furthermore we consider the task of password-based identification. We devise a new quantum identification protocol that is secure in two security models simultaneously.
Entropic Uncertainty relations are powerful tools, especially in quantum cryptography. They typically bound the amount of uncertainty a third-party adversary may hold on a measurement outcome as a result of the measurement overlap. However, when the two measurement bases are biased towards one another, standard entropic uncertainty relations do not always provide optimal lower bounds on the entropy. Here, we derive a new entropic uncertainty relation, for certain quantum states, which can provide a significantly higher bound even if the two measurement bases are no longer mutually unbiased. We evaluate our bound on two different quantum cryptographic protocols, including BB84 with faulty/biased measurement devices, and show that our new bound can produce substantially higher key-rates under several scenarios when compared with prior work using standard entropic uncertainty relations.
Quantum cryptographic protocols solve the longstanding problem of distributing a shared secret string to two distant users by typically making use of one-way quantum channel. However, alternative protocols exploiting two-way quantum channel have been proposed for the same goal and with potential advantages. Here, we overview a security proof for two-way quantum key distribution protocols, against the most general eavesdropping attack, that utilize an entropic uncertainty relation. Then, by resorting to the “smooth” version of involved entropies, we extend such a proof to the case of finite key size. The results will be compared to those available for one-way protocols showing some advantages.
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1-out-of-2 Oblivious Transfer and quantum Bit Commitment are presented and the uncertainty relation is used to prove the security of these protocols in the bounded quantum-storage model according to new strong security definitions. As another application, we consider the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers. The uncertainty relation allows to prove the security of QKD protocols in this setting while tolerating considerably higher error rates compared to the standard model with unbounded adversaries. For instance, for the six-state protocol with one-way communication, a bit-flip error rate of up to 17% can be tolerated (compared to 13% in the standard model). Our uncertainty relation also yields a lower bound on the min-entropy key uncertainty against known-plaintext attacks when quantum ciphers are composed. Previously, the key uncertainty of these ciphers was only known with respect to Shannon entropy.
Due to the capability of tolerating high error rate and generating more key bits per trial, high-dimensional quantum key distribution attracts wide interest.Despite great progresses in high-dimensional quantum key distribution, there are still some gaps between theory and experiment.One of these is that the security of the secret key heavily depends on the number of the emitted signals.So far, the existing security proofs are only suitable in the case with an infinite or unpractically large number of emitted signals.Here, by introducing the idea of "key classification" and developing relevant techniques based on the uncertainty relation for smooth entropies, we propose a tight finite-key analysis suitable for generalized high-dimensional quantum key distribution protocols.Benefitting from our theory, high-dimensional quantum key distribution protocols with finite resources become experimentally feasible.