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

Quantum Information and Computation

Robust variations of secret sharing through noisy quantum channel

Xiu‐Bo Chen, Gang Xu, Yuan Su, Yixian Yang

Published May 1, 2014• 13 citations
Publisher

Abstract

In this paper, the perfect secret sharing in quantum cryptography is investigated. On one hand, the security of a recent protocol [Adhikari et al. Quantum Inform. \& Comput. 12 (2012) 0253-0261] is re-examined. We find that it violates the requirement of information theoretic security in the secret sharing and suffers from the information leakage. The cryptanalysis including several specific attack strategies are given, which shows that a dishonest participant can steal half or all of the secrets without being detected. On the other hand, we design a new quantum secret sharing protocol. The security of protocol is rigorously proved. It meets the fundamental requirement of information theoretic security. Furthermore, the security analysis including both the outside attacks and participant attacks is given in details. It is shown that our proposed protocol can achieve perfect secret sharing.

DOI
10.26421/qic14.7-8-4

Related papers

Cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled state

Shuang Li, Xiao‐Qiu Cai, Shaorui Song +2 more

Quantum secret sharing is a basic quantum cryptographic primitive, which plays an important role in robust key management and secure multiparty computation etc. In this work, we give a cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled states proposed recently, which shows that the controller can recover the secret if he cooperates with any one participant. Furthermore, an external opponent can make participants recover a false secret without being detected by a special denial-of-service attack. Therefore, this protocol does not satisfy the security requirement that any unauthorized set can gain access to no information on the secret and cannot guarantee its correctness.

Scientific Reports•Apr 29, 2025•1 citation

Collusion-Secure Semi-Quantum Secret Sharing Scheme using a Quantum Third Party

Santanu Majhi, Nirupam Basak

The security of a secret sharing protocol is compromised if one or more dishonest participants can reconstruct the secret by deviating from the prescribed protocol, particularly when such malicious behavior remains undetected. Semi-Quantum Secret Sharing (SQSS) is a variant of secret sharing in which the participants possess only classical capabilities, such as preparing and measuring qubits in the computational ($Z$) basis, while a quantum-capable third party assists the dealer in generating and distributing quantum shares of a classical secret. The limited quantum capabilities of the participants in SQSS protocols may introduce vulnerabilities to collusion attacks, enabling an assisting quantum third party, in collaboration with a dishonest classical participant, to jointly recover the secret even without detection. In this work, we propose a novel SQSS protocol that eliminates this vulnerability and achieves information-theoretic security against collusion attacks. We further prove that the proposed protocol is secure against a broad class of external and internal attacks. Finally, a comparative analysis demonstrates that our construction advances existing SQSS protocols by simultaneously optimizing qubit efficiency, involves a classical dealer, and resilience against DCNA attacks using basic Bell states.

cs.CRCross-listedarXiv:2610.10176•Oct 8, 2026•0 citations

Tight Analysis of a One-Shot Quantum Secret Sharing Scheme

Santanu Majhi, Debajyoti Bera

Quantum communication protocols can be designed to detect eavesdropping attacks, something that classical technologies are unable to do since classical information can be replicated in a non-destructive manner. Eavesdropping detection is, therefore, a standard feature in all the proposed quantum secret sharing (QSS) protocols. However, detection is often done by a statistical analysis of the outcome of multiple decoy rounds, and this causes a significant communication overhead. In our quest for a QSS protocol that works even in one round, we came across a one-shot secret-sharing framework proposed by Hsu (Phys. Rev. A 2003). The scheme was designed to work over public channels without requiring multiple rounds to detect eavesdropping but it lacked a thorough security analysis. In this work we present a complete characterisation of the correctness and security properties of this framework. Our characterisation allowed us to improve the original protocol to be more resistant towards eavesdropping. However, we prove a couple of impossibility results, including one that dictates that complete security against an eavesdropper is not possible in this framework. Thus, it is not possible to design a perfect QSS using this framework.

quant-pharXiv:2511.04399•Nov 7, 2025•0 citations

Robust Multiparty Quantum Secret Sharing against Participant Forcible Manipulation

Sun Ying, Wen Qiao-yan, Fu-Chen Zhu

The security of the multiparty quantum secret sharing protocol proposed by Gao [G. Gao, Common. Theor. Phys. 52 (2009) 421] is analyzed. It is shown that this protocol is vulnerable since the agents' imperfect encryption scheme can be attacked by a powerful participant. We introduce a attack strategy called participant forcible manipulation and analyze the information leakage in this protocol under this attack. At last, we give an improved version of the original protocol. The improved protocol is robust and has the same efficiency as the original one.

Communications in Theoretical Physics•Jul 1, 2010•8 citations

Cryptanalysis on the improved multiparty quantum secret sharing protocol based on the GHZ state

Xiu‐Bo Chen, Shuai Yang, Yuan Su +1 more

Recently, Liu et al (2011 Phys. Scr. 84 045015) pointed out that the multiparty quantum secret sharing (MQSS) protocol based on the GHZ state (Hwang et al 2011 Phys. Scr. 83 045004) is insecure. They found that an inside participant can deduce half of the sender's secret information directly just by his piece of the secret. In order to resist this attack, an improvement was put forward. However, in this paper, we find that Liu et al 's improved protocol is still insecure. We give details of three attack strategies to steal the secret information. It is shown that the eavesdropper can steal half or all of the secret information. Furthermore, a simple and ingenious MQSS protocol is proposed. We perform explicit cryptanalysis to prove that our improved protocol can resist the attacks from both the outside attackers and the inside participants, even the collusion attack.

Physica Scripta•Oct 10, 2012•20 citations

Eavesdropping on the orderly-encrypting multiparty quantum secret sharing protocols

Qin Su-Juan, Wen Qiao-yan, Zhu Fuchen

We discuss the security of the kind of multiparty quantum secret sharing protocols encrypting in series. It is secure against the eavesdroppers outside. However it is weak to withstand the attack of insider with a fake signal and cheating. An idiographic attack strategy is given based on the protocol. Furthermore, we conclude the key leak of the protocols and present a possible way to prevent the dishonest agents from stealing the secret.

Wuhan University Journal of Natural Sciences•Nov 1, 2006•0 citations
In this paper, the perfect secret sharing in quantum cryptography is investigated. On one hand, the security of a recent protocol [Adhikari et al. Quantum Inform. & Comput. 12 (2012) 0253-0261] is re-examined. We find that it violates the requirement of information theoretic security in the secret sharing and suffers from the information leakage. The cryptanalysis including several specific attack strategies are given, which shows that a dishonest participant can steal half or all of the secrets without being detected. On the other hand, we design a new quantum secret sharing protocol. The security of protocol is rigorously proved. It meets the fundamental requirement of information theoretic security. Furthermore, the security analysis including both the outside attacks and participant attacks is given in details. It is shown that our proposed protocol can achieve perfect secret sharing.
Quantum secret sharing is a basic quantum cryptographic primitive, which plays an important role in robust key management and secure multiparty computation etc. In this work, we give a cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled states proposed recently, which shows that the controller can recover the secret if he cooperates with any one participant. Furthermore, an external opponent can make participants recover a false secret without being detected by a special denial-of-service attack. Therefore, this protocol does not satisfy the security requirement that any unauthorized set can gain access to no information on the secret and cannot guarantee its correctness.
The security of a secret sharing protocol is compromised if one or more dishonest participants can reconstruct the secret by deviating from the prescribed protocol, particularly when such malicious behavior remains undetected. Semi-Quantum Secret Sharing (SQSS) is a variant of secret sharing in which the participants possess only classical capabilities, such as preparing and measuring qubits in the computational (ZZZ) basis, while a quantum-capable third party assists the dealer in generating and distributing quantum shares of a classical secret. The limited quantum capabilities of the participants in SQSS protocols may introduce vulnerabilities to collusion attacks, enabling an assisting quantum third party, in collaboration with a dishonest classical participant, to jointly recover the secret even without detection. In this work, we propose a novel SQSS protocol that eliminates this vulnerability and achieves information-theoretic security against collusion attacks. We further prove that the proposed protocol is secure against a broad class of external and internal attacks. Finally, a comparative analysis demonstrates that our construction advances existing SQSS protocols by simultaneously optimizing qubit efficiency, involves a classical dealer, and resilience against DCNA attacks using basic Bell states.
Quantum communication protocols can be designed to detect eavesdropping attacks, something that classical technologies are unable to do since classical information can be replicated in a non-destructive manner. Eavesdropping detection is, therefore, a standard feature in all the proposed quantum secret sharing (QSS) protocols. However, detection is often done by a statistical analysis of the outcome of multiple decoy rounds, and this causes a significant communication overhead. In our quest for a QSS protocol that works even in one round, we came across a one-shot secret-sharing framework proposed by Hsu (Phys. Rev. A 2003). The scheme was designed to work over public channels without requiring multiple rounds to detect eavesdropping but it lacked a thorough security analysis. In this work we present a complete characterisation of the correctness and security properties of this framework. Our characterisation allowed us to improve the original protocol to be more resistant towards eavesdropping. However, we prove a couple of impossibility results, including one that dictates that complete security against an eavesdropper is not possible in this framework. Thus, it is not possible to design a perfect QSS using this framework.
The security of the multiparty quantum secret sharing protocol proposed by Gao [G. Gao, Common. Theor. Phys. 52 (2009) 421] is analyzed. It is shown that this protocol is vulnerable since the agents' imperfect encryption scheme can be attacked by a powerful participant. We introduce a attack strategy called participant forcible manipulation and analyze the information leakage in this protocol under this attack. At last, we give an improved version of the original protocol. The improved protocol is robust and has the same efficiency as the original one.
Recently, Liu et al (2011 Phys. Scr. 84 045015) pointed out that the multiparty quantum secret sharing (MQSS) protocol based on the GHZ state (Hwang et al 2011 Phys. Scr. 83 045004) is insecure. They found that an inside participant can deduce half of the sender's secret information directly just by his piece of the secret. In order to resist this attack, an improvement was put forward. However, in this paper, we find that Liu et al 's improved protocol is still insecure. We give details of three attack strategies to steal the secret information. It is shown that the eavesdropper can steal half or all of the secret information. Furthermore, a simple and ingenious MQSS protocol is proposed. We perform explicit cryptanalysis to prove that our improved protocol can resist the attacks from both the outside attackers and the inside participants, even the collusion attack.