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:1801.00745 · IEEE International Symposium on Information Theory (ISIT)

Key-Rate Bound of a Semi-Quantum Protocol Using an Entropic Uncertainty Relation

Walter O. Krawec

Published Jun 1, 2018• 13 citations
arXivHTMLPDF

Abstract

In this paper we present a new proof technique for semi-quantum key distribution (SQKD) protocols which makes use of a quantum entropic uncertainty relation to bound an adversary's information. We develop several new techniques for analyzing SQKD protocols; furthermore, our new proof may hold application in the security analysis of other semi-quantum protocols or protocols relying on two-way quantum communication.

DOI
10.1109/isit.2018.8437303

Related papers

Proving the Security of Mediated Semi‐Quantum Key Distribution Using Entropic Uncertainty Relation

Zhenye Du, Youlong Yang, Tong Ning +1 more

Abstract In recent years, mediated semi‐quantum key distribution (MSQKD) has become a hot topic in quantum cryptography. In this study, the original MSQKD protocol is revisited and a new scheme for proving security based on information theory is developed. At first, a new bound on the key rate of the protocol is derived using an entropic uncertainty relation, thus proving the unconditional security of the protocol. In addition, in the asymptotic scenario, a higher noise tolerance that improves the previous results is found. The legitimate communicating parties have to abort the protocol when they observe the error rate is larger than the noise tolerance. Furthermore, the security of a single‐state MSQKD protocol and a single‐state semi‐quantum key distribution (SQKD) protocol is proven using a similar scheme.

Advanced Quantum Technologies•Jul 2, 2024•2 citations

An Improved Asymptotic Key Rate Bound for a Mediated Semi-Quantum Key Distribution Protocol

Walter O. Krawec

Semi-quantum key distribution (SQKD) protocols allow for the establishment of a secret key between two users Alice and Bob, when one of the two users (typically Bob) is limited or "classical" in nature. Recently it was shown that protocols exists when both parties are limited/classical in nature if they utilize the services of a quantum server. These protocols are called mediated SQKD protocols. This server, however, is untrusted and, in fact, adversarial. In this paper, we reconsider a mediated SQKD protocol and derive a new proof of unconditional security for it. In particular, we derive a new lower bound on its key rate in the asymptotic scenario. Furthermore, we show this new lower bound is an improvement over prior work, thus showing that the protocol in question can tolerate higher rates of error than previously thought.

arXiv:1509.04797•Sep 16, 2015•0 citations

Semi-Quantum Key Distribution with Limited Measurement Capabilities

Walter O. Krawec, Eric P. Geiss

A semi-quantum key distribution (SQKD) protocol allows a quantum user and a limited "classical" user to establish a shared secret key secure against an all-powerful adversary. In this work, we present a new SQKD protocol where the quantum user is also limited in her measurement capabilities. We describe the protocol, perform an information theoretic analysis of its security, and show its noise tolerance is as high as "fully quantum" QKD protocols.

International Symposium on Information Theory and its Applications•Oct 1, 2018•6 citations

An improved asymptotic key rate bound for a mediated semi-quantum key distribution protocol

Walter O. Krawec

Semi-quantum key distribution (SQKD) protocols allow for the establishment of a secret key between two users Alice and Bob, when one of the two users (typically Bob) is limited or “classical” in nature. Recently it was shown that protocols exists when both parties are limited/classical in nature if they utilize the services of a quantum server. These protocols are called mediated SQKD protocols. This server, however, is untrusted and, in fact, adversarial. In this paper, we reconsider a mediated SQKD protocol and derive a new proof of unconditional security for it. In particular, we derive a new lower bound on its key rate in the asymptotic scenario. Furthermore, we show this new lower bound is an improvement over prior work, thus showing that the protocol in question can tolerate higher rates of error than previously thought.

Quantum Information and Computation•Jul 1, 2016•7 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•1 citation

Limited Resource Semi-Quantum Key Distribution

Walter O. Krawec, Eric P. Geiss

A semi-quantum key distribution (SQKD) protocol allows a quantum user and a limited "classical" user to establish a shared secret key secure against an all-powerful adversary. In this work, we present a new SQKD protocol where the quantum user is also limited in her measurement capabilities. We describe the protocol, prove its security, and show its noise tolerance is as high as "fully quantum" QKD protocols.

arXiv:1710.05076•Oct 13, 2017•5 citations
In this paper we present a new proof technique for semi-quantum key distribution (SQKD) protocols which makes use of a quantum entropic uncertainty relation to bound an adversary's information. We develop several new techniques for analyzing SQKD protocols; furthermore, our new proof may hold application in the security analysis of other semi-quantum protocols or protocols relying on two-way quantum communication.
Abstract In recent years, mediated semi‐quantum key distribution (MSQKD) has become a hot topic in quantum cryptography. In this study, the original MSQKD protocol is revisited and a new scheme for proving security based on information theory is developed. At first, a new bound on the key rate of the protocol is derived using an entropic uncertainty relation, thus proving the unconditional security of the protocol. In addition, in the asymptotic scenario, a higher noise tolerance that improves the previous results is found. The legitimate communicating parties have to abort the protocol when they observe the error rate is larger than the noise tolerance. Furthermore, the security of a single‐state MSQKD protocol and a single‐state semi‐quantum key distribution (SQKD) protocol is proven using a similar scheme.
Semi-quantum key distribution (SQKD) protocols allow for the establishment of a secret key between two users Alice and Bob, when one of the two users (typically Bob) is limited or "classical" in nature. Recently it was shown that protocols exists when both parties are limited/classical in nature if they utilize the services of a quantum server. These protocols are called mediated SQKD protocols. This server, however, is untrusted and, in fact, adversarial. In this paper, we reconsider a mediated SQKD protocol and derive a new proof of unconditional security for it. In particular, we derive a new lower bound on its key rate in the asymptotic scenario. Furthermore, we show this new lower bound is an improvement over prior work, thus showing that the protocol in question can tolerate higher rates of error than previously thought.
Semi-quantum key distribution (SQKD) protocols allow for the establishment of a secret key between two users Alice and Bob, when one of the two users (typically Bob) is limited or “classical” in nature. Recently it was shown that protocols exists when both parties are limited/classical in nature if they utilize the services of a quantum server. These protocols are called mediated SQKD protocols. This server, however, is untrusted and, in fact, adversarial. In this paper, we reconsider a mediated SQKD protocol and derive a new proof of unconditional security for it. In particular, we derive a new lower bound on its key rate in the asymptotic scenario. Furthermore, we show this new lower bound is an improvement over prior work, thus showing that the protocol in question can tolerate higher rates of error than previously thought.
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.