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

Comment on “Multiparty quantum secret sharing of classical messages based on entanglement swapping”

Song Lin, Fei Gao, Fen-Zhuo Guo, Qiaoyan Wen, Fu-Chen Zhu

Published Sep 26, 2007• 84 citations
Publisher

Abstract

In a recent paper [Z. J. Zhang and Z. X. Man, Phys. Rev. A 72, 022303 (2005)], a multiparty quantum secret sharing protocol based on entanglement swapping was presented. However, as we show, this protocol is insecure in the sense that an unauthorized agent group can recover the secret from the dealer. Hence we propose an improved version of this protocol which can stand against this kind of attack.

DOI
10.1103/physreva.76.036301

Related papers

Improving the security of multiparty quantum secret sharing based on entanglement swapping against participant attack

Song Lin, Fei Gao, Fen-Zhuo Guo +2 more

In a recent paper [Z. J. Zhang and Z. X. Man, Phys. Rev. A 72, 022303(2005)], a multiparty quantum secret sharing protocol based on entanglement swapping was presented. However, as we show, this protocol is insecure in the sense that an unauthorized agent group can recover the secret from the dealer. Hence, we propose an improved version of this protocol which can stand against this kind of attack.

arXiv:quant-ph/0612066•Dec 9, 2006•0 citations

Enhanced multiparty quantum secret sharing of classical messages based on entanglement swapping

Yao–Hsin Chou, R.-K. Fan, Shuo-Mao Chen +2 more

Based on the multiparty quantum secret sharing protocol [Z. J. Zhang and Z. X. Man, Phys. Rev. A 72, 022303 (2005)] , we proposed two schemes to enhance the transmission efficiency of whole protocol. In our improved version of the Zhang-Man protocol which the dealer can transmit double amount of secret messages at a time securely instead of doing the Zhang-Man protocol twice. Besides, we save a lot of cost of whole quantum secret sharing system. When the amount of secret messages is large and the number of agents is more, the performance of our schemes is much better than the ZhangMan protocol.

International Conference on Frontier Computing: Theory, Technologies and Applications (FC)•Jan 1, 2010•2 citations

Reexamining Security of Improved Multiparty Quantum Secret Splitting and Quantum State Sharing

Song Lin

In a recent letter [H.F. Wang, X. Ji, and S. Zhang, Phys. Lett. A 358 (2006) 11], an improvement of the multiparty quantum secret splitting and quantum state sharing protocol [F.G. Deng, et al., Phys. Lett. A 354 (2006) 190.] was presented. We study the security of the improved protocol and find that two or more dishonest participants may recover the secret from the dealer. Hence we further modify the improved protocol, which make it stand against this kind of attack.

Communications in Theoretical Physics•Jun 1, 2010•2 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

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

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•4 citations
In a recent paper [Z. J. Zhang and Z. X. Man, Phys. Rev. A 72, 022303 (2005)], a multiparty quantum secret sharing protocol based on entanglement swapping was presented. However, as we show, this protocol is insecure in the sense that an unauthorized agent group can recover the secret from the dealer. Hence we propose an improved version of this protocol which can stand against this kind of attack.
Based on the multiparty quantum secret sharing protocol [Z. J. Zhang and Z. X. Man, Phys. Rev. A 72, 022303 (2005)] , we proposed two schemes to enhance the transmission efficiency of whole protocol. In our improved version of the Zhang-Man protocol which the dealer can transmit double amount of secret messages at a time securely instead of doing the Zhang-Man protocol twice. Besides, we save a lot of cost of whole quantum secret sharing system. When the amount of secret messages is large and the number of agents is more, the performance of our schemes is much better than the ZhangMan protocol.
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.
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.
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.