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

Modern Physics Letters B

Multiparty semiquantum secret sharing based on rearranging orders of qubits

Gan Gao, Yue Wang, Dong Wang

Published Apr 11, 2016• 42 citations
Publisher

Abstract

Based on the assumption of a perfect qubit, Boyer et al. proposed a novel semiquantum key distribution protocol [Phys. Rev. Lett. 99 (2007) 140501], in which quantum Alice shares a secret key with classical Bob. In this paper, we use Bell states to propose a multiparty semiquantum secret sharing (MSQSS) protocol, in which only the boss is quantum and all agents are classical. Classical agents are restricted to performing measurements in a computational basis and rearranging orders of qubits. Unless all classical agents collaborate, no subset of them can obtain the secret of the quantum boss. Also, we show that this proposed protocol is secure against eavesdropping.

DOI
10.1142/s021798491650130x

Related papers

Semiquantum Key Distribution Using Entangled States

Jian Wang, Sheng Zhang, Quan Zhang +1 more

Recently, Boyer et al. presented a novel semiquantum key distribution protocol [ Phys. Rev. Lett. 99 (2007) 140501 ] by using four quantum states, each of which is randomly prepared in the Z or X basis. Here we present a semi-quantum key distribution protocol by using maximally entangled states in which quantum Alice shares a secret key with classical Bob. Quantum Alice has the ability to prepare Bell states and perform Bell basis or computational basis measurement. Classical Bob is restricted to measuring, preparing a particle in the computational basis, reflecting or reordering the particles. The qubit efficiency of the protocol improves to 50% and the protocol can be modified to a measure-resend protocol or a protocol without quantum memory. We also show that the protocol is secure against eavesdropping.

arXiv:1104.1267•Chinese Physics Letters•Oct 1, 2011•100 citations

SEMIQUANTUM SECRET SHARING USING TWO-PARTICLE ENTANGLED STATE

Jian Wang, Sheng Zhang, Quan Zhang +1 more

We present a semiquantum secret sharing protocol by using two-particle entangled states in which quantum Alice shares a secret key with two classical parties, Bob and Charlie. Classical Bob and Charlie are restricted to measuring, preparing a particle in the computational basis, or reflecting the particles. None of them can acquire the secret unless they collaborate. We also show the protocol is secure against eavesdropping.

arXiv:1104.1270•International Journal of Quantum Information•Aug 1, 2012•68 citations

Quantum secret sharing with classical Bobs

Lvzhou Li, Daowen Qiu, Paulo Mateus

Boyer, Kenigsberg, and Mor [Phys.Rev.Lett.99, 140501(2007)] proposed a novel idea of semi-quantum key distribution where a key can be securely distributed between Alice who can perform any quantum operation and Bob who is classical. Extending the idea of “semiquantum” to other tasks of quantum information processing is of interest and worth considering. In this article, we consider the issue of semi-quantum secret sharing where a quantum participant Alice can share a secret key with two classical participants Bobs. After analyzing the existing protocol, we propose a new protocol of semi-quantum secret sharing. Our protocol is more realistic, since it utilizes product states instead of entangled states. We prove that any attempt of an adversary to obtain information necessarily induces some errors that the legitimate users could notice. 1

Journal of Physics A Mathematical and Theoretical•Jan 10, 2013•125 citations

Cryptanalysis and improvement of multiparty semiquantum secret sharing based on rearranging orders of qubits

Aihan Yin, Fangbo Fu

Recently, a multiparty semiquantum secret sharing scheme based on rearranging orders of qubits was proposed by Gao et al. [Mod. Phys. Lett. B 30 (2016) 1650130]. In this paper, we show that in their scheme the last agent and other agents can illegally get the sender’s secret keys without being detected. Furthermore, an improved scheme is proposed to resist such attack.

Modern Physics Letters B•Dec 13, 2016•2 citations

Efficient mediated multiparty semi-quantum secret sharing protocol based on single-qubit reordering

Mustapha Anis Younes, Sofia Zebboudj, Abdelhakim Gharbi

Typical multiparty semi-quantum secret sharing (MSQSS) protocols require the dealer to possess full quantum capabilities, while the classical users usually need to perform three operations. To address this practical limitation, this paper introduces a new mediated MSQSS protocol that enables Alice, a classical user, to share a secret with [Formula: see text] classical Bobs, with the assistance of an untrusted third party (TP) who may attempt any possible attack to steal Alice’s secret. Furthermore, the classical participants require only two capabilities instead of three, namely: (a) performing measurements in the [Formula: see text] basis; and (b) reordering qubits. The proposed scheme offers significant advantages over existing mediated QSS protocols: (1) It is the first mediated SQSS protocol to adopt single qubits, instead of entangled states, as the quantum resource, which makes it more practical and easier to implement; (2) It achieves higher qubit efficiency. Security analysis also demonstrates that the protocol is secure against well-known attacks.

arXiv:2508.05487•International Journal of Quantum Information•May 28, 2026•0 citations

Single-state multiparty semiquantum secret sharing with d-dimensional Bell states

Ying Chen, Gan, Zhi-Gang, Tian-Yu Ye

A single-state multiparty semiquantum secret sharing (MSQSS) scheme with d-dimensional Bell states is proposed, which can accomplish the goal that only when all receivers work together can they restore the sender's secret key. This protocol is validated to be secure against both the outside attack and the participant attack. This protocol is adaptive for the d-dimensional system, only employs one kind of d-dimensional Bell states as initial quantum resource and needs neither quantum entanglement swapping nor unitary operations.

arXiv:2209.11391•Sep 23, 2022•0 citations
Based on the assumption of a perfect qubit, Boyer et al. proposed a novel semiquantum key distribution protocol [Phys. Rev. Lett. 99 (2007) 140501], in which quantum Alice shares a secret key with classical Bob. In this paper, we use Bell states to propose a multiparty semiquantum secret sharing (MSQSS) protocol, in which only the boss is quantum and all agents are classical. Classical agents are restricted to performing measurements in a computational basis and rearranging orders of qubits. Unless all classical agents collaborate, no subset of them can obtain the secret of the quantum boss. Also, we show that this proposed protocol is secure against eavesdropping.
Recently, Boyer et al. presented a novel semiquantum key distribution protocol [ Phys. Rev. Lett. 99 (2007) 140501 ] by using four quantum states, each of which is randomly prepared in the Z or X basis. Here we present a semi-quantum key distribution protocol by using maximally entangled states in which quantum Alice shares a secret key with classical Bob. Quantum Alice has the ability to prepare Bell states and perform Bell basis or computational basis measurement. Classical Bob is restricted to measuring, preparing a particle in the computational basis, reflecting or reordering the particles. The qubit efficiency of the protocol improves to 50% and the protocol can be modified to a measure-resend protocol or a protocol without quantum memory. We also show that the protocol is secure against eavesdropping.
Boyer, Kenigsberg, and Mor [Phys.Rev.Lett.99, 140501(2007)] proposed a novel idea of semi-quantum key distribution where a key can be securely distributed between Alice who can perform any quantum operation and Bob who is classical. Extending the idea of “semiquantum” to other tasks of quantum information processing is of interest and worth considering. In this article, we consider the issue of semi-quantum secret sharing where a quantum participant Alice can share a secret key with two classical participants Bobs. After analyzing the existing protocol, we propose a new protocol of semi-quantum secret sharing. Our protocol is more realistic, since it utilizes product states instead of entangled states. We prove that any attempt of an adversary to obtain information necessarily induces some errors that the legitimate users could notice. 1
Typical multiparty semi-quantum secret sharing (MSQSS) protocols require the dealer to possess full quantum capabilities, while the classical users usually need to perform three operations. To address this practical limitation, this paper introduces a new mediated MSQSS protocol that enables Alice, a classical user, to share a secret with [Formula: see text] classical Bobs, with the assistance of an untrusted third party (TP) who may attempt any possible attack to steal Alice’s secret. Furthermore, the classical participants require only two capabilities instead of three, namely: (a) performing measurements in the [Formula: see text] basis; and (b) reordering qubits. The proposed scheme offers significant advantages over existing mediated QSS protocols: (1) It is the first mediated SQSS protocol to adopt single qubits, instead of entangled states, as the quantum resource, which makes it more practical and easier to implement; (2) It achieves higher qubit efficiency. Security analysis also demonstrates that the protocol is secure against well-known attacks.
A single-state multiparty semiquantum secret sharing (MSQSS) scheme with d-dimensional Bell states is proposed, which can accomplish the goal that only when all receivers work together can they restore the sender's secret key. This protocol is validated to be secure against both the outside attack and the participant attack. This protocol is adaptive for the d-dimensional system, only employs one kind of d-dimensional Bell states as initial quantum resource and needs neither quantum entanglement swapping nor unitary operations.