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

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

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

Published Sep 23, 2022• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2209.11391

Related papers

Multiparty semiquantum secret sharing based on rearranging orders of qubits

Gan Gao, Yue Wang, Dong Wang

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.

Modern Physics Letters B•Apr 11, 2016•42 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

Hybrid protocols for multi-party semiquantum private comparison, multiplication and summation without a pre-shared key based on d-dimensional single-particle states

Jiang-Yuan Lian, Tian-Yu Ye

Abstract In this paper, by utilizing d -dimensional single-particle states, three semiquantum cryptography protocols, i.e., the multi-party semiquantum private comparison (MSQPC) protocol, the multi-party semiquantum multiplication (MSQM) protocol and the multi-party semiquantum summation (MSQS) protocol, can be achieved simultaneously under the assistance of two semi-honest quantum third parties (TPs). Here, the proposed MSQPC scheme is the only protocol which is devoted to judging the size relationship of secret integers from more than two semiquantum participants without a pre-shared key. And the proposed MSQM protocol absorbs the innovative concept of semiquantumness into quantum multiplication for the first time, which can calculate the modulo d multiplication of private inputs from more than two semiquantum users. As for the proposed MSQS protocol, it is the only semiquantum summation protocol which aims to accomplish the modulo d addition of more than three semiquantum users’ private integers. Neither quantum entanglement swapping nor unitary operations are necessary in the three proposed protocols. The security analysis verifies in detail that both the external attacks and the internal attacks can be resisted in the three proposed protocols.

EPJ Quantum Technology•Mar 13, 2024•30 citations

An efficient multiparty quantum secret sharing scheme using a single qudit

WenWen Hu, Bangshu Xiong, Ri‐Gui Zhou

The aim of quantum secret sharing, as one of most promising components of quantum cryptograph, is one-to-multiparty secret communication based on the principles of quantum mechanics. In this paper, an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed. Each participant's shadow is encoded on a single qudit via a measuring basis encryption method, which avoids the waste of qudits caused by basis reconciliation. Security analysis indicates that the proposed protocol is immune to general attacks, such as the measure-resend attack, entangle-and-measure attack and Trojan horse attack. Compared to former protocols, the proposed protocol only needs to perform the single-qudit measurement operation, and can share the predetermined dits instead of random bits or dits.

Chinese Physics B•Nov 17, 2022•7 citations

Multiparty semi-quantum secret sharing protocol based on single photon sequence and permutation

Xiangjun Xin, Fan He, Chaoyang Li +1 more

Most semi-quantum secret sharing protocols are suitable for the application with three participants. Based on the n-level states, a multiparty semi-quantum secret sharing protocol is proposed. Compared with similar protocols, it has the merits as follows. (1) The dealer only needs to prepare the single photon sequence without using any product state or entangle state. (2) To share a secret, the classical parties need not have the ability of measurement. They only need to reorder the photon sequence and send it to the receiver. (3) The dealer knows nothing about any agent’s secret shadow. Therefore, it is infeasible for the dealer to impersonate the classical participant to pool the secret shadow during the secret recovering phase. (4) Theoretically, the qubit efficiency of the proposed protocol is asymptotically 100%. The protocol is secure against famous attacks such as intercept-resend attack, measurement-resend attack and entangle-measure attack.

Modern Physics Letters A•Jun 14, 2024•8 citations

Multiparty quantum secret sharing of classical messages based on entanglement swapping

Zhanjun Zhang, Zhong‐Xiao Man

A multiparty quantum secret sharing (QSS) protocol of classical messages (i.e., classical bits) is proposed by using swapping quantum entanglement of Bell states. The secret messages are imposed on Bell states by local unitary operations. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In addition, dense coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed and confirmed even in a noisy quantum channel.

arXiv:quant-ph/0406103•Physical Review A•Aug 4, 2005•416 citations
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.
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.
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.
Abstract In this paper, by utilizing d -dimensional single-particle states, three semiquantum cryptography protocols, i.e., the multi-party semiquantum private comparison (MSQPC) protocol, the multi-party semiquantum multiplication (MSQM) protocol and the multi-party semiquantum summation (MSQS) protocol, can be achieved simultaneously under the assistance of two semi-honest quantum third parties (TPs). Here, the proposed MSQPC scheme is the only protocol which is devoted to judging the size relationship of secret integers from more than two semiquantum participants without a pre-shared key. And the proposed MSQM protocol absorbs the innovative concept of semiquantumness into quantum multiplication for the first time, which can calculate the modulo d multiplication of private inputs from more than two semiquantum users. As for the proposed MSQS protocol, it is the only semiquantum summation protocol which aims to accomplish the modulo d addition of more than three semiquantum users’ private integers. Neither quantum entanglement swapping nor unitary operations are necessary in the three proposed protocols. The security analysis verifies in detail that both the external attacks and the internal attacks can be resisted in the three proposed protocols.
The aim of quantum secret sharing, as one of most promising components of quantum cryptograph, is one-to-multiparty secret communication based on the principles of quantum mechanics. In this paper, an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed. Each participant's shadow is encoded on a single qudit via a measuring basis encryption method, which avoids the waste of qudits caused by basis reconciliation. Security analysis indicates that the proposed protocol is immune to general attacks, such as the measure-resend attack, entangle-and-measure attack and Trojan horse attack. Compared to former protocols, the proposed protocol only needs to perform the single-qudit measurement operation, and can share the predetermined dits instead of random bits or dits.
Most semi-quantum secret sharing protocols are suitable for the application with three participants. Based on the n-level states, a multiparty semi-quantum secret sharing protocol is proposed. Compared with similar protocols, it has the merits as follows. (1) The dealer only needs to prepare the single photon sequence without using any product state or entangle state. (2) To share a secret, the classical parties need not have the ability of measurement. They only need to reorder the photon sequence and send it to the receiver. (3) The dealer knows nothing about any agent’s secret shadow. Therefore, it is infeasible for the dealer to impersonate the classical participant to pool the secret shadow during the secret recovering phase. (4) Theoretically, the qubit efficiency of the proposed protocol is asymptotically 100%. The protocol is secure against famous attacks such as intercept-resend attack, measurement-resend attack and entangle-measure attack.
A multiparty quantum secret sharing (QSS) protocol of classical messages (i.e., classical bits) is proposed by using swapping quantum entanglement of Bell states. The secret messages are imposed on Bell states by local unitary operations. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In addition, dense coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed and confirmed even in a noisy quantum channel.