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

Physical Review A

Semiquantum-key distribution using less than four quantum states

Xiangfu Zou, Daowen Qiu, Lvzhou Li, Lihua Wu, Lvjun Li

Published May 12, 2009• 204 citations
Publisher

Abstract

Recently Boyer et al. [Phys. Rev. Lett. 99, 140501 (2007)] suggested the idea of semiquantum key distribution (SQKD) in which Bob is classical and they also proposed a semiquantum key distribution protocol (BKM2007). To discuss the security of the BKM2007 protocol, they proved that their protocol is completely robust. This means that nonzero information acquired by Eve on the information string implies the nonzero probability that the legitimate participants can find errors on the bits tested by this protocol. The BKM2007 protocol uses four quantum states to distribute a secret key. In this paper, we simplify their protocol by using less than four quantum states. In detail, we present five different SQKD protocols in which Alice sends three quantum states, two quantum states, and one quantum state, respectively. Also, we prove that all the five protocols are completely robust. In particular, we invent two completely robust SQKD protocols in which Alice sends only one quantum state. Alice uses a register in one SQKD protocol, but she does not use any register in the other. The information bit proportion of the SQKD protocol in which Alice sends only one quantum state but uses a register is the double as that in the BKM2007 protocol. Furthermore, the information bit rate of the SQKD protocol in which Alice sends only one quantum state and does not use any register is not lower than that of the BKM2007 protocol.

DOI
10.1103/physreva.79.052312

Related papers

A new semi-quantum key distribution protocol with high efficiency

Wei Liu, Huaijun Zhou

Boyer et al put forward the first semi-quantum key distribution (BKM2007), which is completely robust while one side is limited. However, its efficiency is not satisfactory. In this paper, we present a high-efficient semi-quantum key distribution. The efficiency for qubits is approximately 50% while that is approximately 25% in the BKM2007 protocol, which means that the sifted key proportion of the SQKD protocol is double as that in the BKM2007 protocol. Furthermore, the proportion of information bits in our SQKD protocol is not lower than that of the BKM2007 protocol. Analysis shows that our protocol is still robust.

IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)•Oct 1, 2018•2 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

Efficient semiquantum key distribution

Ming‐Ming Wang, Linming Gong, Lian-He Shao

Quantum cryptography has attracted much attention in recent years. In most existing quantum cryptographic protocols, players usually need the full quantum power of generating, manipulating or measuring quantum states. Semiquantum cryptography was proposed to deal with the issue that some players require only partial quantum power, such as preparing or measuring quantum states in the classical basis, which simplifies the implementations of quantum cryptography. However, the efficiency of the existing semiquantum cryptographic protocols was relatively low from a practical point of view. In this paper, we devise some new semiquantum key distribution (SQKD) protocols which highly improve the efficiency of the most well-known SQKD protocols [Phys. Rev. Lett. 99, 140501 (2007) & Phys. Rev. A 79, 052312 (2009)]. By letting players select their actions asymmetrically, the efficiency of our new protocols can be made asymptotically close to 100%. Besides, one of our proposed protocols also utilizes the discarded X-SIFT bits in the original SQKD protocol, which further improves the efficiency of SQKD. We prove that the proposed SQKD protocols are completely robust against the most general attack.

arXiv:1811.03190•Nov 7, 2018•0 citations

Semiquantum key distribution

Michel Boyer, Ran Gelles, Dan Kenigsberg +1 more

Secure key distribution between two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a secure key distribution is possible when both parties are quantum. What is possible when only one party (Alice) is quantum, yet the other (Bob) has only classical capabilities? Recently, a semiquantum key distribution protocol was presented [M. Boyer, D. Kenigsberg, and T. Mor, Phys. Rev. Lett. 99, 140501 (2007)], in which one of the parties (Bob) is classical, and yet, the protocol is proven to be completely robust against an eavesdropping attempt. Here we extend that result much further. We present two protocols with this constraint and prove their complete robustness against attacks: we prove that any attempt of an adversary to obtain information (and even a tiny amount of information) necessarily induces some errors that the legitimate parties could notice. One protocol presented here is identical to the one referred to above; however, its robustness is proven here in a much more general scenario. The other protocol is very different as it is based on randomization.

arXiv:0812.4835•Physical Review A•Mar 30, 2009•298 citations

Experimentally feasible protocol for semiquantum key distribution

Michel Boyer, Matty Katz, Rotem Liss +1 more

Quantum key distribution (QKD) protocols make it possible for two quantum parties to generate a secret shared key. Semiquantum key distribution (SQKD) protocols, such as ``QKD with classical Bob'' and ``QKD with classical Alice'' (that have both been proven robust), achieve this goal even if one of the parties is classical. However, existing SQKD protocols are not experimentally feasible with current technology. Here we suggest a protocol, ``Classical Alice with a controllable mirror,'' that can be experimentally implemented with current technology (using four-level systems instead of qubits), and we prove it to be robust.

arXiv:1701.07044•Physical Review A•Dec 29, 2017•73 citations

Single-state semi-quantum key distribution protocol and its security proof

Zhang Wei, Daowen Qiu, Paulo Mateus

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 protocol in fully quantum cryptography into SQKD. In this protocol, the sender Alice just sends one quantum state to the classical Bob and Bob just prepares a fixed state in the preparation process. It is much simpler than the existing SQKD and potentially much easier to be implemented. It can be seen as a semi-quantum version of B92 protocol, compared to the protocol BKM07 as the semi-quantum version of BB84 in fully quantum cryptography. We verify that it is more efficient than the existing single-state SQKD protocols by introducing an efficiency parameter. Specifically, we prove it is secure against a restricted collective attack by computing a lower bound of the key rate in the asymptotic scenario. Then we can find a threshold value of errors such that for all error rates less than this value, the secure key can be definitely established between the legitimate users definitely. We make an illustration of how to compute the threshold value in case the reverse channel is a depolarizing one with parameter [Formula: see text]. Though the threshold value is a little smaller than those of some existing SQKD protocols, it can be comparable to the B92 protocol in fully quantum cryptography.

International Journal of Quantum Information•Jun 1, 2020•18 citations
Recently Boyer et al. [Phys. Rev. Lett. 99, 140501 (2007)] suggested the idea of semiquantum key distribution (SQKD) in which Bob is classical and they also proposed a semiquantum key distribution protocol (BKM2007). To discuss the security of the BKM2007 protocol, they proved that their protocol is completely robust. This means that nonzero information acquired by Eve on the information string implies the nonzero probability that the legitimate participants can find errors on the bits tested by this protocol. The BKM2007 protocol uses four quantum states to distribute a secret key. In this paper, we simplify their protocol by using less than four quantum states. In detail, we present five different SQKD protocols in which Alice sends three quantum states, two quantum states, and one quantum state, respectively. Also, we prove that all the five protocols are completely robust. In particular, we invent two completely robust SQKD protocols in which Alice sends only one quantum state. Alice uses a register in one SQKD protocol, but she does not use any register in the other. The information bit proportion of the SQKD protocol in which Alice sends only one quantum state but uses a register is the double as that in the BKM2007 protocol. Furthermore, the information bit rate of the SQKD protocol in which Alice sends only one quantum state and does not use any register is not lower than that of the BKM2007 protocol.
Boyer et al put forward the first semi-quantum key distribution (BKM2007), which is completely robust while one side is limited. However, its efficiency is not satisfactory. In this paper, we present a high-efficient semi-quantum key distribution. The efficiency for qubits is approximately 50% while that is approximately 25% in the BKM2007 protocol, which means that the sifted key proportion of the SQKD protocol is double as that in the BKM2007 protocol. Furthermore, the proportion of information bits in our SQKD protocol is not lower than that of the BKM2007 protocol. Analysis shows that our protocol is still robust.
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.
Quantum cryptography has attracted much attention in recent years. In most existing quantum cryptographic protocols, players usually need the full quantum power of generating, manipulating or measuring quantum states. Semiquantum cryptography was proposed to deal with the issue that some players require only partial quantum power, such as preparing or measuring quantum states in the classical basis, which simplifies the implementations of quantum cryptography. However, the efficiency of the existing semiquantum cryptographic protocols was relatively low from a practical point of view. In this paper, we devise some new semiquantum key distribution (SQKD) protocols which highly improve the efficiency of the most well-known SQKD protocols [Phys. Rev. Lett. 99, 140501 (2007) & Phys. Rev. A 79, 052312 (2009)]. By letting players select their actions asymmetrically, the efficiency of our new protocols can be made asymptotically close to 100%. Besides, one of our proposed protocols also utilizes the discarded X-SIFT bits in the original SQKD protocol, which further improves the efficiency of SQKD. We prove that the proposed SQKD protocols are completely robust against the most general attack.
Secure key distribution between two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a secure key distribution is possible when both parties are quantum. What is possible when only one party (Alice) is quantum, yet the other (Bob) has only classical capabilities? Recently, a semiquantum key distribution protocol was presented [M. Boyer, D. Kenigsberg, and T. Mor, Phys. Rev. Lett. 99, 140501 (2007)], in which one of the parties (Bob) is classical, and yet, the protocol is proven to be completely robust against an eavesdropping attempt. Here we extend that result much further. We present two protocols with this constraint and prove their complete robustness against attacks: we prove that any attempt of an adversary to obtain information (and even a tiny amount of information) necessarily induces some errors that the legitimate parties could notice. One protocol presented here is identical to the one referred to above; however, its robustness is proven here in a much more general scenario. The other protocol is very different as it is based on randomization.
Quantum key distribution (QKD) protocols make it possible for two quantum parties to generate a secret shared key. Semiquantum key distribution (SQKD) protocols, such as ``QKD with classical Bob'' and ``QKD with classical Alice'' (that have both been proven robust), achieve this goal even if one of the parties is classical. However, existing SQKD protocols are not experimentally feasible with current technology. Here we suggest a protocol, ``Classical Alice with a controllable mirror,'' that can be experimentally implemented with current technology (using four-level systems instead of qubits), and we prove it to be robust.
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 protocol in fully quantum cryptography into SQKD. In this protocol, the sender Alice just sends one quantum state to the classical Bob and Bob just prepares a fixed state in the preparation process. It is much simpler than the existing SQKD and potentially much easier to be implemented. It can be seen as a semi-quantum version of B92 protocol, compared to the protocol BKM07 as the semi-quantum version of BB84 in fully quantum cryptography. We verify that it is more efficient than the existing single-state SQKD protocols by introducing an efficiency parameter. Specifically, we prove it is secure against a restricted collective attack by computing a lower bound of the key rate in the asymptotic scenario. Then we can find a threshold value of errors such that for all error rates less than this value, the secure key can be definitely established between the legitimate users definitely. We make an illustration of how to compute the threshold value in case the reverse channel is a depolarizing one with parameter [Formula: see text]. Though the threshold value is a little smaller than those of some existing SQKD protocols, it can be comparable to the B92 protocol in fully quantum cryptography.