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

Comment on “Three-party quantum secret sharing based on d-dimensional Bell state”

Gan Gao, Hongru Song

Published Sep 23, 2019• 0 citations
Publisher

Abstract

In the paper [Mod. Phys. Lett. B 33 (2019) 1950023 ], Qin et al. proposed a three-party quantum secret sharing scheme based on [Formula: see text]-dimensional Bell states. We study the security of the proposed scheme and find that it is not secure, that is, one sharer can obtain Alice’s secret messages without the help of the other sharer.

DOI
10.1142/s0217984919503470

Related papers

Cryptanalysis of a semi-quantum secret sharing scheme based on Bell states

Gan Gao, Yue Wang, Dong Wang

In the paper [Mod. Phys. Lett. B 31 (2017) 1750150], Yin et al. proposed a semi-quantum secret sharing scheme by using Bell states. We find that the proposed scheme cannot finish the quantum secret sharing task. In addition, we also find that the proposed scheme has a security loophole, that is, it will not be detected that the dishonest participant, Charlie attacks on the quantum channel.

Modern Physics Letters B•Mar 16, 2018•15 citations

Reply to “Comment on ‘Multiparty quantum secret sharing of classical messages based on entanglement swapping’ ”

Zhanjun Zhang, Zhong‐Xiao Man

In Ref. 1 , we proposed a multiparty quantum secret sharing QSS protocol based on Bell-state entanglement swapping. Our multiparty protocol is a general one, that is, it contains both the three-party n=3 case and its generalization to a more-party n 4 case. Recently, in Ref. 2 the authors first pointed out some advantages of our protocol, such as dense coding, easy implementation, high efficiency, etc. Then they claimed that if our protocol is attacked by the so-called participant attack, the protocol is insecure. In fact, our multiparty n 3 QSS protocol is secure against any outsiders’ or insider’s eavesdropping. Only the generalized protocol i.e., the n 4 QSS protocol is insecure under the specific dishonest insiders’ attack as shown in Ref. 2 . Nonetheless, this leak in the generalized protocol can be easily fixed and accordingly the advantage of high efficiency in our protocol can be retained. We will explain these as follows. In Ref. 1 , when we simply generalized our three-party protocol to a n n 4 -party one, we changed the original qubit distribution method due to our carelessness. The original distribution method is that Alice prepares the qubits and distributes them to her two agents. When generalizing, we changed the qubit distribution in such a way that each party sends a qubit to the next party. It is this change which leads to the insecurity under the special attack case 2 . The comment 2 aims essentially at this change. That is, the two dishonest parties who each initially shares an e-bit with the sender can let one of them share both the two e-bits and the other one shares none by exchanging their qubits and cheating. In this case, the protocol is insecure. It is a minor leak in our protocol. If the change about qubit distribution is removed during the generalization, that is, the same qubit distributions as that in the three-party case are maintained when generalizing, then the security of the n n 4 -party protocol can still be assured. The reason is as follows. When the sender distributes two qubits to an agent one by one, if the sender does not tell the agent the orderings of the two qubits, the agent cannot distinguish their orderings for the two qubits are identical. In this case, the two agents who share entanglements with the sender cannot assure that only one of them can definitively share the entanglements with the sender by exchanging their qubits. To be explicit, let us take the four-party case as an example: Alice prepares four photon Einstein-Podolsky-Rosen EPR pairs A2,B1 , B2,C1 , C2,D1 , and D2,A1 . She sends two photons B1,B2 to Bob, C1,C2 to Charlie, and D1, D2 to Dick. In this case, Alice shares the EPR pair A2, B1 with Bob and the EPR pair A1, D2 with Dick. Note that each sharer Bob, Charlie, Dick cannot differentiate his two photons since their two photons are identical. In this case, Bob or Dick cannot correctly let only one sharer say, Bob hereafter share two EPR pairs by exchanging their photons. Obviously, with probability 1/2 Bob may send the photon B1 to Dick. Also with probability 1/2, Dick may send the photon D1 to Bob. In either case, the goal of deterministically letting Bob share two EPR pairs with Alice cannot be realized via the exchange. Consequently, the so-called participant attack is invalid. Hence the leak in our generalized protocol can be easily fixed and accordingly the advantage of high efficiency the authors of Ref. 2 admitted is retained. Incidentally, the modification in Ref. 2 can fix the leak of our protocol also, however, it decreases the efficiency of the protocol.

Physical Review A•Sep 26, 2007•8 citations

Multiparty Quantum Secret Sharing Using Two-Photon Three-Dimensional Bell States

Gan Gao

We present a two-photon three-dimensional multiparty quantum secret sharing scheme. The secret messages are encoded by performing local operations. This is different from those quantum secret sharing protocols that all sharers must make a state measurement. The merit of our protocol is the high capacity.

Communications in Theoretical Physics•Sep 1, 2009•33 citations

Three-party quantum secret sharing based on d-dimensional Bell state

Huawang Qin, K.S. Tang, Raylin Tso

A three-party quantum secret sharing scheme is proposed, in which the dealer uses the d-dimensional Bell state to distribute the secret, the participants perform the single-particle measurements to get their shares, and the dealer performs the Bell-basis measurements to check the eavesdropping. The main merit of our scheme is that the participants only need to measure the particles in one basis. Compared to the existing schemes in which the participants need to measure the particles in two bases, our scheme will be more practical.

Modern Physics Letters B•Jan 16, 2019•5 citations

Comment on “Quantum secret sharing between multiparty and multiparty without entanglement”

Chuan-Ming Li, Chi-Chao Chang, Tzonelih Hwang

Recently, Yan and Gao [Phys. Rev. A 72, 012304 (2005)] presented a quantum secret sharing protocol which allows a secret message to be shared between two groups of parties ($m$ parties in group 1 and $n$ parties in group 2). Their protocol is claimed to be secure that, except with the cooperation of the entire group 1 or group 2, no subgroup of either group 1 or group 2 can extract the secret message. However, this study points out that the $m\text{th}$ party (the last party to process the quantum state) of group 1 can maliciously replace the secret message with an arbitrary message without the detection of the other parties.

Physical Review A•Jan 6, 2006•35 citations

Comment on ‘Authenticated quantum secret sharing with quantum dialogue based on Bell states’

Gan Gao, Yue Wang, Dong Wang +1 more

Abstract In the paper (2016 Phys. Scr. 91 085101 ), Abulkasim et al proposed a authenticated quantum secret sharing scheme. We study the security of the multiparty case in the proposed scheme and find that it is not secure.

Physica Scripta•Jan 9, 2018•13 citations
In the paper [Mod. Phys. Lett. B 33 (2019) 1950023 ], Qin et al. proposed a three-party quantum secret sharing scheme based on [Formula: see text]-dimensional Bell states. We study the security of the proposed scheme and find that it is not secure, that is, one sharer can obtain Alice’s secret messages without the help of the other sharer.
In Ref. 1 , we proposed a multiparty quantum secret sharing QSS protocol based on Bell-state entanglement swapping. Our multiparty protocol is a general one, that is, it contains both the three-party n=3 case and its generalization to a more-party n 4 case. Recently, in Ref. 2 the authors first pointed out some advantages of our protocol, such as dense coding, easy implementation, high efficiency, etc. Then they claimed that if our protocol is attacked by the so-called participant attack, the protocol is insecure. In fact, our multiparty n 3 QSS protocol is secure against any outsiders’ or insider’s eavesdropping. Only the generalized protocol i.e., the n 4 QSS protocol is insecure under the specific dishonest insiders’ attack as shown in Ref. 2 . Nonetheless, this leak in the generalized protocol can be easily fixed and accordingly the advantage of high efficiency in our protocol can be retained. We will explain these as follows. In Ref. 1 , when we simply generalized our three-party protocol to a n n 4 -party one, we changed the original qubit distribution method due to our carelessness. The original distribution method is that Alice prepares the qubits and distributes them to her two agents. When generalizing, we changed the qubit distribution in such a way that each party sends a qubit to the next party. It is this change which leads to the insecurity under the special attack case 2 . The comment 2 aims essentially at this change. That is, the two dishonest parties who each initially shares an e-bit with the sender can let one of them share both the two e-bits and the other one shares none by exchanging their qubits and cheating. In this case, the protocol is insecure. It is a minor leak in our protocol. If the change about qubit distribution is removed during the generalization, that is, the same qubit distributions as that in the three-party case are maintained when generalizing, then the security of the n n 4 -party protocol can still be assured. The reason is as follows. When the sender distributes two qubits to an agent one by one, if the sender does not tell the agent the orderings of the two qubits, the agent cannot distinguish their orderings for the two qubits are identical. In this case, the two agents who share entanglements with the sender cannot assure that only one of them can definitively share the entanglements with the sender by exchanging their qubits. To be explicit, let us take the four-party case as an example: Alice prepares four photon Einstein-Podolsky-Rosen EPR pairs A2,B1 , B2,C1 , C2,D1 , and D2,A1 . She sends two photons B1,B2 to Bob, C1,C2 to Charlie, and D1, D2 to Dick. In this case, Alice shares the EPR pair A2, B1 with Bob and the EPR pair A1, D2 with Dick. Note that each sharer Bob, Charlie, Dick cannot differentiate his two photons since their two photons are identical. In this case, Bob or Dick cannot correctly let only one sharer say, Bob hereafter share two EPR pairs by exchanging their photons. Obviously, with probability 1/2 Bob may send the photon B1 to Dick. Also with probability 1/2, Dick may send the photon D1 to Bob. In either case, the goal of deterministically letting Bob share two EPR pairs with Alice cannot be realized via the exchange. Consequently, the so-called participant attack is invalid. Hence the leak in our generalized protocol can be easily fixed and accordingly the advantage of high efficiency the authors of Ref. 2 admitted is retained. Incidentally, the modification in Ref. 2 can fix the leak of our protocol also, however, it decreases the efficiency of the protocol.
A three-party quantum secret sharing scheme is proposed, in which the dealer uses the d-dimensional Bell state to distribute the secret, the participants perform the single-particle measurements to get their shares, and the dealer performs the Bell-basis measurements to check the eavesdropping. The main merit of our scheme is that the participants only need to measure the particles in one basis. Compared to the existing schemes in which the participants need to measure the particles in two bases, our scheme will be more practical.
Recently, Yan and Gao [Phys. Rev. A 72, 012304 (2005)] presented a quantum secret sharing protocol which allows a secret message to be shared between two groups of parties (mmm parties in group 1 and nnn parties in group 2). Their protocol is claimed to be secure that, except with the cooperation of the entire group 1 or group 2, no subgroup of either group 1 or group 2 can extract the secret message. However, this study points out that the mthm\text{th}mth party (the last party to process the quantum state) of group 1 can maliciously replace the secret message with an arbitrary message without the detection of the other parties.