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 A

Eavesdropping on the multiparty semi-quantum secret sharing protocol based on single qubit sequence and permutation

Gan Gao, Xueying Cui, Ming Fang

Published Feb 11, 2026• 1 citation
Publisher

Abstract

The paper [Xin et al., Mod. Phys. Lett. A 39, 2450084 (2024)] proposed a multiparty semi-quantum secret sharing protocol based on the single qubit sequence and the permutations of the qubit locations. We study the security of the proposed protocol and point out that there exists a security loophole in it, that is, the first and last agents can collude to obtain Tom’s secret without the help of the other agents.

DOI
10.1142/s021773232650080x

Related papers

Cryptanalysis of efficient semi-quantum secret sharing protocol using single particles

Gan Gao

In paper [Chin. Phys. B 32 070308 (2023)], Xing et al. proposed a semi-quantum secret sharing protocol by using single particles. We study the security of the proposed protocol and find that it is not secure, that is, the three dishonest agents, Bob, Charlie and Emily can collude to obtain Alice’s secret without the help of David.

Chinese Physics B•Feb 22, 2024•9 citations

Cryptanalysis and improvement of efficient multiparty quantum secret sharing based on a novel structure and single qubits

Gan Gao

Abstract In the paper (EPJ Quant. Technol. 10:29, 2023), Kuo et al. proposed a multiparty quantum secret sharing protocol based on a novel structure and single qubits. Owing to the absence of an entanglement state, the proposed protocol is more practical than other quantum secret sharing protocols which use entanglement properties. Therefore, we study the security of the proposed protocol and find there exists a security loophole in the n-party ( $n\geq 4$ n ≥ 4 ) secret sharing case in it, that is, two dishonest agents can collude to obtain (part of) Alice’s secret without the help of the other agents. In order to overcome the security loophole, we give an improved protocol and make a security analysis for it. By calculating, the qubit efficiency of the three-party case in it is equal to $\frac{1}{8}$ 1 8 , which is higher than that in Hillery et al.’s protocol (Phys. Rev. A 59:1829, 1999).

EPJ Quantum Technology•Mar 25, 2024•9 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•9 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

Cryptanalysis and Improvement of a Quantum Secret Sharing Protocol between Multiparty and Multiparty with Single Photons and Unitary Transformations

Zhen-Chao Zhu, Yuqing Zhang

In a recent paper [ Chin. Phys. Lett 25(2008)1187 ], a quantum secret sharing scheme between multiparty and multiparty was presented. We show that the protocol is not secure because the last member in Alice's group can illegally obtain most secret messages without introducing any error. Finally, a possible way to avoid the security flaw is suggested.

Chinese Physics Letters•Jun 1, 2010•10 citations

Addendum to "Quantum secret sharing between multiparty and multiparty without entanglement"

Fu‐Guo Deng, Fengli Yan, Xihan Li +3 more

Recently, Yan and Gao proposed a quantum secret sharing protocol between multiparty ($m$ members in group 1) and multiparty ($n$ members in group 2) using a sequence of single photons (Phys. Rev. A \textbf{72}, 012304 (2005)). We find that it is secure if the quantum signal transmitted is only a single photon but insecure with a multi-photon signal as some agents can get the information about the others' message if they attack the communication with a Trojan horse. However, security against this attack can be attained with a simple modification.

arXiv:quant-ph/0508171•Aug 23, 2005•7 citations
The paper [Xin et al., Mod. Phys. Lett. A 39, 2450084 (2024)] proposed a multiparty semi-quantum secret sharing protocol based on the single qubit sequence and the permutations of the qubit locations. We study the security of the proposed protocol and point out that there exists a security loophole in it, that is, the first and last agents can collude to obtain Tom’s secret without the help of the other agents.
Abstract In the paper (EPJ Quant. Technol. 10:29, 2023), Kuo et al. proposed a multiparty quantum secret sharing protocol based on a novel structure and single qubits. Owing to the absence of an entanglement state, the proposed protocol is more practical than other quantum secret sharing protocols which use entanglement properties. Therefore, we study the security of the proposed protocol and find there exists a security loophole in the n-party ( n≥4n\geq 4n≥4 n ≥ 4 ) secret sharing case in it, that is, two dishonest agents can collude to obtain (part of) Alice’s secret without the help of the other agents. In order to overcome the security loophole, we give an improved protocol and make a security analysis for it. By calculating, the qubit efficiency of the three-party case in it is equal to 18\frac{1}{8}81​ 1 8 , which is higher than that in Hillery et al.’s protocol (Phys. Rev. A 59:1829, 1999).
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.
Recently, Yan and Gao proposed a quantum secret sharing protocol between multiparty (mmm members in group 1) and multiparty (nnn members in group 2) using a sequence of single photons (Phys. Rev. A \textbf{72}, 012304 (2005)). We find that it is secure if the quantum signal transmitted is only a single photon but insecure with a multi-photon signal as some agents can get the information about the others' message if they attack the communication with a Trojan horse. However, security against this attack can be attained with a simple modification.