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:0801.2418 · Physical Review A

Cryptanalysis of the Hillery-Bužek-Berthiaume quantum secret-sharing protocol

Su‐Juan Qin, Fei Gao, Qiaoyan Wen, Fu-Chen Zhu

Published Dec 27, 2007• 362 citations
arXivHTMLPDF

Abstract

The participant attack is the most serious threat for quantum secret-sharing protocols. We present a method to analyze the security of quantum secret-sharing protocols against this kind of attack taking the scheme of Hillery, Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and Berthiaume (HBB) [Phys. Rev. A 59, 1829 (1999)] as an example. By distinguishing between two mixed states, we derive the necessary and sufficient conditions under which a dishonest participant can attain all the information without introducing any error, which shows that the HBB protocol is insecure against dishonest participants. It is easy to verify that the attack scheme of Karlsson, Koashi, and Imoto [Phys. Rev. A 59, 162 (1999)] is a special example of our results. To demonstrate our results further, we construct an explicit attack scheme according to the necessary and sufficient conditions. Our work completes the security analysis of the HBB protocol, and the method presented may be useful for the analysis of other similar protocols.

DOI
10.1103/physreva.76.062324

Related papers

REEXAMINING THE SECURITY OF THE RECONSTRUCTION PHASE OF THE HILLERY-BUZĚK-BERTHIAUME QUANTUM SECRET-SHARING PROTOCOL

Yu‐Guang Yang, Weifeng Cao, Qiaoyan Wen

The participant attack is the most serious threat for quantum secret-sharing protocols. However, it is only during the transmission of quantum information carriers that attention is paid to this kind of attack in the existing quantum secret-sharing protocols. The security considerations of the secret reconstruction phase of quantum secret-sharing protocols against this kind of attack are neglected. We demonstrate our viewpoint by taking the scheme of Hillery, Buzěk, and Berthiaume (HBB) [Phys. Rev. A59 (1999) 18–29] as an example. By telling a lie in the reconstruction phase, a dishonest participant can easily attain the entire secret key instead of eavesdropping during the transmission awkwardly, whereas the honest one cannot judge whether the dishonest one tells the truth and the obtained secret random key is identical to what the secret distributor owns because of lack of verification mechanism in the HBB protocol. It is not difficult to find that almost all the quantum secret-sharing protocols have such disadvantages. Our viewpoint presented may be useful for the design of other similar protocols.

International Journal of Quantum Information•Oct 1, 2009•0 citations

Experimentally feasible security check for n -qubit quantum secret sharing

Stefan Schauer, Marcus Huber, Beatrix C. Hiesmayr

In this article we present a general security strategy for quantum secret sharing (QSS) protocols based on the scheme presented by Hillery, Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and Berthiaume (HBB) [Phys. Rev. A 59, 1829 (1999)]. We focus on a generalization of the HBB protocol to $n$ communication parties thus including $n$-partite Greenberger-Horne-Zeilinger states. We show that the multipartite version of the HBB scheme is insecure in certain settings and impractical when going to large $n$. To provide security for such QSS schemes in general we use the framework presented by some of the authors [M. Huber, F. Mintert, A. Gabriel, B. C. Hiesmayr, Phys. Rev. Lett. 104, 210501 (2010)] to detect certain genuine $n$-partite entanglement between the communication parties. In particular, we present a simple inequality which tests the security.

arXiv:1009.4796•Physical Review A•Dec 13, 2010•51 citations

Efficient multiparty quantum-secret-sharing schemes

Xiao Li, Gui Lu Long, Fu‐Guo Deng +1 more

In this work, we generalize the quantum-secret-sharing scheme of Hillery, Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and Berthiaume [Phys. Rev. A 59, 1829 (1999)] into arbitrary multiparties. Explicit expressions for the shared secret bit is given. It is shown that in the Hillery-Bu\ifmmode \check{z}\else \v{z}\fi{}ek-Berthiaume quantum-secret-sharing scheme the secret information is shared in the parity of binary strings formed by the measured outcomes of the participants. In addition, we have increased the efficiency of the quantum-secret-sharing scheme by generalizing two techniques from quantum key distribution. The favored-measuring-basis quantum-secret-sharing scheme is developed from the Lo-Chau-Ardehali technique [H. K. Lo, H. F. Chau, and M. Ardehali, e-print quant-ph∕0011056] where all the participants choose their measuring-basis asymmetrically, and the measuring-basis-encrypted quantum-secret-sharing scheme is developed from the Hwang-Koh-Han technique [W. Y. Hwang, I. G. Koh, and Y. D. Han, Phys. Lett. A 244, 489 (1998)] where all participants choose their measuring basis according to a control key. Both schemes are asymptotically $100%$ in efficiency, hence nearly all the Greenberger-Horne-Zeilinger states in a quantum-secret-sharing process are used to generate shared secret information.

arXiv:quant-ph/0405179•Physical Review A•May 11, 2004•838 citations

Opaque Cheat Attack on Quantum Secret Sharing Schemes Based on Entanglement

Fu‐Guo Deng, Xihan Li, Hong-Yu Zhou

Security of the one-way quantum secret sharing (QSS) schemes based on entanglement and a collective eavesdropping check is analyzed in the case of considerable quantum channel losses. An opaque cheat attack scheme is presented for the dishonest agent, which reveals that these QSS schemes are completely insecure for transmission efficiencies lower than 50%. That is, the dishonest agent can eavesdrop fully and freely in almost all the one-way QSS schemes based on entanglement if the quantum channel induces 50% losses, including the two pioneer works, the Hillery-Bu\v{z}ek-Berthiaume scheme and the Karlsson-Koashi-Imoto scheme. Finally, we present two ways for possible improvement of these schemes.

•May 2, 2007•0 citations

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

Song Lin, Wen Qiao-yan, Liu Xiao-Fen

In a recent paper [Yan F L et al. Chin. Phys. Lett. 25 (2008) 1187 ], a quantum secret sharing the protocol between multiparty and multiparty with single photons and unitary transformations was presented. We analyze the security of the protocol and find that a dishonest participant can eavesdrop the key by using a special attack. Finally, we give a description of this strategy and put forward an improved version of this protocol which can stand against this kind of attack.

Chinese Physics Letters•Dec 1, 2009•6 citations

Fake-signal-and-cheating attack on quantum secret sharing

Fu‐Guo Deng, Xihan Li, Chen Pan +2 more

We present a fake-signal-and-cheating attack strategy for the dishonest agent in quantum secret sharing (QSS) to steal the information of the other agents' fully and freely. It is found that almost all the QSS protocols existing, such as the two famous QSS protocols, the Hillery-Bu$\check{z}$ek-Berthiaume [Phys. Rev. A \textbf{59}, 1829 (1999)] and the Karlsson-Koashi-Imoto [Phys. Rev. A \textbf{59}, 162 (1999)], can be eavesdropped freely if the process for the eavesdropping check is accomplished with the cooperation of the dishonest agent. He can sends a fake signal to the other agents after intercepting the original photons and storing them. His action can be hidden with entanglement swapping and cheating when the photons are chosen as the samples for checking eavesdropping. Finally, we present a possible improvement of these QSS protocols' security with decoy photons.

arXiv:quant-ph/0604060•Apr 10, 2006•1 citation
The participant attack is the most serious threat for quantum secret-sharing protocols. We present a method to analyze the security of quantum secret-sharing protocols against this kind of attack taking the scheme of Hillery, Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and Berthiaume (HBB) [Phys. Rev. A 59, 1829 (1999)] as an example. By distinguishing between two mixed states, we derive the necessary and sufficient conditions under which a dishonest participant can attain all the information without introducing any error, which shows that the HBB protocol is insecure against dishonest participants. It is easy to verify that the attack scheme of Karlsson, Koashi, and Imoto [Phys. Rev. A 59, 162 (1999)] is a special example of our results. To demonstrate our results further, we construct an explicit attack scheme according to the necessary and sufficient conditions. Our work completes the security analysis of the HBB protocol, and the method presented may be useful for the analysis of other similar protocols.
The participant attack is the most serious threat for quantum secret-sharing protocols. However, it is only during the transmission of quantum information carriers that attention is paid to this kind of attack in the existing quantum secret-sharing protocols. The security considerations of the secret reconstruction phase of quantum secret-sharing protocols against this kind of attack are neglected. We demonstrate our viewpoint by taking the scheme of Hillery, Buzěk, and Berthiaume (HBB) [Phys. Rev. A59 (1999) 18–29] as an example. By telling a lie in the reconstruction phase, a dishonest participant can easily attain the entire secret key instead of eavesdropping during the transmission awkwardly, whereas the honest one cannot judge whether the dishonest one tells the truth and the obtained secret random key is identical to what the secret distributor owns because of lack of verification mechanism in the HBB protocol. It is not difficult to find that almost all the quantum secret-sharing protocols have such disadvantages. Our viewpoint presented may be useful for the design of other similar protocols.
In this article we present a general security strategy for quantum secret sharing (QSS) protocols based on the scheme presented by Hillery, Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and Berthiaume (HBB) [Phys. Rev. A 59, 1829 (1999)]. We focus on a generalization of the HBB protocol to nnn communication parties thus including nnn-partite Greenberger-Horne-Zeilinger states. We show that the multipartite version of the HBB scheme is insecure in certain settings and impractical when going to large nnn. To provide security for such QSS schemes in general we use the framework presented by some of the authors [M. Huber, F. Mintert, A. Gabriel, B. C. Hiesmayr, Phys. Rev. Lett. 104, 210501 (2010)] to detect certain genuine nnn-partite entanglement between the communication parties. In particular, we present a simple inequality which tests the security.
In this work, we generalize the quantum-secret-sharing scheme of Hillery, Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and Berthiaume [Phys. Rev. A 59, 1829 (1999)] into arbitrary multiparties. Explicit expressions for the shared secret bit is given. It is shown that in the Hillery-Bu\ifmmode \check{z}\else \v{z}\fi{}ek-Berthiaume quantum-secret-sharing scheme the secret information is shared in the parity of binary strings formed by the measured outcomes of the participants. In addition, we have increased the efficiency of the quantum-secret-sharing scheme by generalizing two techniques from quantum key distribution. The favored-measuring-basis quantum-secret-sharing scheme is developed from the Lo-Chau-Ardehali technique [H. K. Lo, H. F. Chau, and M. Ardehali, e-print quant-ph∕0011056] where all the participants choose their measuring-basis asymmetrically, and the measuring-basis-encrypted quantum-secret-sharing scheme is developed from the Hwang-Koh-Han technique [W. Y. Hwang, I. G. Koh, and Y. D. Han, Phys. Lett. A 244, 489 (1998)] where all participants choose their measuring basis according to a control key. Both schemes are asymptotically 100100%100 in efficiency, hence nearly all the Greenberger-Horne-Zeilinger states in a quantum-secret-sharing process are used to generate shared secret information.
Security of the one-way quantum secret sharing (QSS) schemes based on entanglement and a collective eavesdropping check is analyzed in the case of considerable quantum channel losses. An opaque cheat attack scheme is presented for the dishonest agent, which reveals that these QSS schemes are completely insecure for transmission efficiencies lower than 50%. That is, the dishonest agent can eavesdrop fully and freely in almost all the one-way QSS schemes based on entanglement if the quantum channel induces 50% losses, including the two pioneer works, the Hillery-Bu\v{z}ek-Berthiaume scheme and the Karlsson-Koashi-Imoto scheme. Finally, we present two ways for possible improvement of these schemes.
We present a fake-signal-and-cheating attack strategy for the dishonest agent in quantum secret sharing (QSS) to steal the information of the other agents' fully and freely. It is found that almost all the QSS protocols existing, such as the two famous QSS protocols, the Hillery-Buzˇ\check{z}zˇek-Berthiaume [Phys. Rev. A \textbf{59}, 1829 (1999)] and the Karlsson-Koashi-Imoto [Phys. Rev. A \textbf{59}, 162 (1999)], can be eavesdropped freely if the process for the eavesdropping check is accomplished with the cooperation of the dishonest agent. He can sends a fake signal to the other agents after intercepting the original photons and storing them. His action can be hidden with entanglement swapping and cheating when the photons are chosen as the samples for checking eavesdropping. Finally, we present a possible improvement of these QSS protocols' security with decoy photons.