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:2205.06528

Scalable Mediated Semi-quantum Key Distribution

Chong‐Qiang Ye, Jian Li, Xiu‐Bo Chen, Yanyan Hou

Published May 13, 2022• 0 citations
arXivHTMLPDF

Abstract

Mediated semi-quantum key distribution (M-SQKD) permits two limited "semi-quantum" or "classical" users to establish a secret key with the help of a third party (TP), in which TP has fully quantum power and may be untrusted. Several protocols have been studied recently for two-party scenarios, but no one has considered M-SQKD for multi-party scenarios. In this paper, we design a circular M-SQKD protocol based on Bell states, which offers an approach to realizing multiple "classical" users' key distribution. Then, we prove the protocol is unconditional security in the asymptotic scenario. The protocol's key rate and noise tolerance can be derived by utilizing the parameters observed in the channel. The results show that our protocol may hold similar security to a fully quantum one. We also compare the proposed protocol with similar protocols in terms of noise tolerance, qubit efficiency, communication cost, and scalability. Finally, the security proof method of this paper may contribute to studying the security of other circular semi-quantum cryptography protocols.

DOI
10.48550/arxiv.2205.06528

Related papers

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

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

Multi-Mediated Semi-Quantum Key Distribution

Walter O. Krawec

A semi-quantum key distribution (SQKD) protocol allows two users A and B to establish a shared secret key that is secure against an all-powerful adversary E even when one of the users (e.g., B) is semi-quantum or classical in nature while the other is fully-quantum. A mediated SQKD protocol allows two semi-quantum users to establish a key with the help of an adversarial quantum server. We introduce the concept of a multi-mediated SQKD protocol where two (or more) adversarial quantum servers are used. We construct a new protocol in this model and show how it can withstand high levels of quantum noise, though at a cost to efficiency. We perform an information theoretic security analysis and, along the way, prove a general security result applicable to arbitrary MM-SQKD protocols. Finally, a comparison is made to previous (S)QKD protocols.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2019•10 citations

An efficient lightweight mediated semi-quantum key distribution with single-particle states

Yihua Zhou, Xiang-Rui Li, Yu‐Guang Yang +1 more

Abstract In this paper, we propose an efficient lightweight mediated semi-quantum key distribution (LM-SQKD) protocol, which enables two lightweight participants to securely establish a shared key with the help of an untrusted third party (TP). Compared with existing M-SQKD protocols, our protocol significantly reduces the overall quantum burden and improves the qubit efficiency, where TP only needs to prepare and measure qubits in the X basis and two lightweight participants are just required to execute three unitary operations and reflect qubits. Furthermore, the detailed security analysis verifies that the proposed protocol can against three well-known attacks.

Physica Scripta•Jun 2, 2025•3 citations

Semi-quantum key distribution using qudit systems and security proof

WenWen Hu, Ri‐Gui Zhou, She-Xiang Jiang

Most prior semi-quantum key distribution (SQKD) protocols are designed in the context of qubits. In this paper, we proposed an SQKD protocol using ([Formula: see text]+1) quantum states in two mutually unbiased bases in the context of qudits without invoking the classical party’s measurement capability. It not only decreases the quantum states sent by quantum party by half, but also improves the efficiency of key rate than qubits do. To prove the security of present protocol, we first illustrate that the present protocol is completely robust, and then prove its unconditional security from information theoretical perspective by computing its key rate and noise tolerance against cloning-based individual attack. The unconditional security proof demonstrates that the higher dimension of quantum system is, the higher key rate can be obtained and the higher noise tolerance is allowed in depolarization channel.

International Journal of Quantum Information•Jul 20, 2023•6 citations

A single-state semi-quantum key distribution protocol and its security proof

Wei Zhang, Daowen Qiu

Semi-quantum key distribution (SQKD) can share secret keys by using less quantum resource than its fully quantum counterparts, and this likely makes SQKD become more practical and realizable. In this paper, we present a new SQKD protocol by introducing the idea of B92 into semi-quantum key distribution and prove its unconditional security. In this protocol, the sender Alice just sends one qubit to the classical Bob and Bob just prepares one state in the preparation process. Indeed the classical user's measurement is not necessary either. This protocol can reduce some quantum communication and make it easier to be implemented. It can be seen as the semi-quantum version of B92 protocol, comparing to the protocol BKM2007 as the semi-quantum version of BB84 in fully quantum cryptography. We verify it has higher key rate and therefore is more efficient. Specifically we prove it is unconditionally secure by computing a lower bound of the key rate in the asymptotic scenario from information theory aspect. Then we can find a threshold value of errors such that for all error rates less than this value, the secure key can be established between the legitimate users definitely. We make an illustration of how to compute the threshold value in case of the reverse channel is a depolarizing one with parameter $p$. Though the threshold value is a little smaller than those of some existed SQKD protocols, it can be comparable to the B92 protocol in fully quantum cryptography.

arXiv:1612.03087•Dec 3, 2016•12 citations
Mediated semi-quantum key distribution (M-SQKD) permits two limited "semi-quantum" or "classical" users to establish a secret key with the help of a third party (TP), in which TP has fully quantum power and may be untrusted. Several protocols have been studied recently for two-party scenarios, but no one has considered M-SQKD for multi-party scenarios. In this paper, we design a circular M-SQKD protocol based on Bell states, which offers an approach to realizing multiple "classical" users' key distribution. Then, we prove the protocol is unconditional security in the asymptotic scenario. The protocol's key rate and noise tolerance can be derived by utilizing the parameters observed in the channel. The results show that our protocol may hold similar security to a fully quantum one. We also compare the proposed protocol with similar protocols in terms of noise tolerance, qubit efficiency, communication cost, and scalability. Finally, the security proof method of this paper may contribute to studying the security of other circular semi-quantum cryptography protocols.
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.
A semi-quantum key distribution (SQKD) protocol allows two users A and B to establish a shared secret key that is secure against an all-powerful adversary E even when one of the users (e.g., B) is semi-quantum or classical in nature while the other is fully-quantum. A mediated SQKD protocol allows two semi-quantum users to establish a key with the help of an adversarial quantum server. We introduce the concept of a multi-mediated SQKD protocol where two (or more) adversarial quantum servers are used. We construct a new protocol in this model and show how it can withstand high levels of quantum noise, though at a cost to efficiency. We perform an information theoretic security analysis and, along the way, prove a general security result applicable to arbitrary MM-SQKD protocols. Finally, a comparison is made to previous (S)QKD protocols.
Abstract In this paper, we propose an efficient lightweight mediated semi-quantum key distribution (LM-SQKD) protocol, which enables two lightweight participants to securely establish a shared key with the help of an untrusted third party (TP). Compared with existing M-SQKD protocols, our protocol significantly reduces the overall quantum burden and improves the qubit efficiency, where TP only needs to prepare and measure qubits in the X basis and two lightweight participants are just required to execute three unitary operations and reflect qubits. Furthermore, the detailed security analysis verifies that the proposed protocol can against three well-known attacks.
Most prior semi-quantum key distribution (SQKD) protocols are designed in the context of qubits. In this paper, we proposed an SQKD protocol using ([Formula: see text]+1) quantum states in two mutually unbiased bases in the context of qudits without invoking the classical party’s measurement capability. It not only decreases the quantum states sent by quantum party by half, but also improves the efficiency of key rate than qubits do. To prove the security of present protocol, we first illustrate that the present protocol is completely robust, and then prove its unconditional security from information theoretical perspective by computing its key rate and noise tolerance against cloning-based individual attack. The unconditional security proof demonstrates that the higher dimension of quantum system is, the higher key rate can be obtained and the higher noise tolerance is allowed in depolarization channel.
Semi-quantum key distribution (SQKD) can share secret keys by using less quantum resource than its fully quantum counterparts, and this likely makes SQKD become more practical and realizable. In this paper, we present a new SQKD protocol by introducing the idea of B92 into semi-quantum key distribution and prove its unconditional security. In this protocol, the sender Alice just sends one qubit to the classical Bob and Bob just prepares one state in the preparation process. Indeed the classical user's measurement is not necessary either. This protocol can reduce some quantum communication and make it easier to be implemented. It can be seen as the semi-quantum version of B92 protocol, comparing to the protocol BKM2007 as the semi-quantum version of BB84 in fully quantum cryptography. We verify it has higher key rate and therefore is more efficient. Specifically we prove it is unconditionally secure by computing a lower bound of the key rate in the asymptotic scenario from information theory aspect. Then we can find a threshold value of errors such that for all error rates less than this value, the secure key can be established between the legitimate users definitely. We make an illustration of how to compute the threshold value in case of the reverse channel is a depolarizing one with parameter ppp. Though the threshold value is a little smaller than those of some existed SQKD protocols, it can be comparable to the B92 protocol in fully quantum cryptography.