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

Journal of Physics A Mathematical and Theoretical

Cryptanalysis and improvement of fair quantum secret sharing based on symmetric bivariate polynomial

Jiebin Gu, Feixiang Li, Shixin Zhu

Published Oct 29, 2025• 1 citation
Publisher

Abstract

Abstract As a fundamental component of quantum cryptography, quantum secret sharing (SS) faces a critical security challenge: dishonest participants may gain exclusive access to the shared secret through deceptive actions. To address this, recent advances in fair quantum SS have emerged, allowing equitable secret access among all participants. However, our analysis reveals security vulnerabilities in Bai et al ’s fair quantum SS scheme (Physica A, 2022). First, we show that Bai et al ’s scheme is vulnerable to collusion attack by m − 1 dishonest participants when m − 1 ⩾ t , where t is the threshold value. Second, we point that Bai et al ’s scheme is insecure under our defined attack model—the latent attack. In this work, a possible improved scheme is proposed to overcome the security flaws and halve the computational cost.

DOI
10.1088/1751-8121/ae190b

Related papers

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•1 citation

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

Vulnerabilities and Attacks on Quantum Secret Sharing (QSS) Schemes: A Review

Ajay Kumar, Mukesh Sharma

Quantum secret sharing (QSS) allows a dealer to split a secret among several players so that only authorized coalitions can recover it, while any eavesdropping is revealed by quantum disturbance. Since the first proposals in 1999 [3–5], a long series of cryptanalyses has shown that many QSS protocols fail not because of outside eavesdroppers but because of their own players. In this paper, we review the flaws in and attacks on QSS from 1999 to 2026. We classify the attacks into three layers: protocol-level attacks (intercept-resend, entangle-measure, Trojan horse and fake-signal); insider attacks by dishonest or colluding participants, which are especially powerful because insiders control part of the security check; and implementation-level (side-channel) attacks, which exploit imperfect sources, detectors and local oscillators. For each class, we describe the attack mechanism, representative protocols that were broken, and the countermeasures that followed, such as decoy states, one-way transmission with wavelength filtering, measurement-device-independent (MDI) and device-independent (DI) QSS, and composable finite-key proofs that treat dishonest players as adversaries. We conclude that the field is converging on a single lesson: a QSS protocol is only as secure as the participant model behind its proof, so security proofs must treat every player as a potential adversary with full access to their own devices. We end with open problems for QSS in quantum networks.

International Journal For Multidisciplinary Research•Nov 8, 2026•0 citations

Improving security of efficient multiparty quantum secret sharing based on a novel structure and single qubits

Xiao‐Qiu Cai, Shuang Li, Zi‐Fan Liu +1 more

Quantum secret sharing is a basic quantum cryptographic primitive, which has a lot of applications in information security and privacy preservation. An efficient multiparty quantum secret sharing protocol (Kuo et al. in EPJ Quantum Technol 10(1):29, 2023) based on a novel structure and single qubits was reported recently. In this paper, we give a cryptanalysis of this protocol and show that it cannot satisfy the security requirement for secret sharing because an unauthorized set of agents can gain access to some information on the dealer's secret by a special collusion attack. Furthermore, we put forward a way to deal with the security problem.

Scientific Reports•Aug 8, 2024•10 citations

Quantum secret sharing with (m, n) threshold: QFT and identity authentication

Priyanka Mawlia, Vikash Siwach, Pankaj Bijaranian +1 more

Abstract In the field of quantum cryptography, Quantum Secret Sharing (QSS) holds substantial importance, with identity authentication emerging as a key strategy for safeguarding information. It efficiently certifies the identification of both persons involved in the conversation, which contributes to increased security measures. Our proposal, a (m, n) threshold Quantum Secret Sharing (QSS) scheme introduces a unique approach to mutual identity authentication, utilizing mutually unbiased bases. During the secret recovery phase, the scheme ensures that secrets exclusively held by participants remain undisclosed and are not transmitted, reinforcing the security of the communication process. As a result, external eavesdroppers are left empty-handed in their attempt to access information about secrets during this phase. Our protocol surpasses in terms of security, effectiveness, and practicality, proving its resilience against intercept–resend attacks, collusion attacks, collective attacks, and forgery attacks according to a comprehensive security analysis.

Quantum Information Processing•Oct 16, 2024•15 citations

Cryptanalysis and improvement of the novel semi-quantum secret sharing scheme using entangled states

Qijian He, Wei Yang, Bingren Chen +1 more

A semi-quantum secret sharing scheme using entangled states was proposed in a recent paper [Mod. Phys. Lett. B 32 (2018) 1850256. https://doi.org/10.1142/S0217984918502561 ]. We find a loophole of this scheme. Based on the intercept-resend attack, we propose a deterministic attack strategy and a probabilistic attack strategy. The malicious participant can escape the detection and obtains the secret. We also suggest two improvements to help increase the security of the original scheme.

Modern Physics Letters B•Jan 21, 2019•10 citations
Abstract As a fundamental component of quantum cryptography, quantum secret sharing (SS) faces a critical security challenge: dishonest participants may gain exclusive access to the shared secret through deceptive actions. To address this, recent advances in fair quantum SS have emerged, allowing equitable secret access among all participants. However, our analysis reveals security vulnerabilities in Bai et al ’s fair quantum SS scheme (Physica A, 2022). First, we show that Bai et al ’s scheme is vulnerable to collusion attack by m − 1 dishonest participants when m − 1 ⩾ t , where t is the threshold value. Second, we point that Bai et al ’s scheme is insecure under our defined attack model—the latent attack. In this work, a possible improved scheme is proposed to overcome the security flaws and halve the computational cost.
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 secret sharing (QSS) allows a dealer to split a secret among several players so that only authorized coalitions can recover it, while any eavesdropping is revealed by quantum disturbance. Since the first proposals in 1999 [3–5], a long series of cryptanalyses has shown that many QSS protocols fail not because of outside eavesdroppers but because of their own players. In this paper, we review the flaws in and attacks on QSS from 1999 to 2026. We classify the attacks into three layers: protocol-level attacks (intercept-resend, entangle-measure, Trojan horse and fake-signal); insider attacks by dishonest or colluding participants, which are especially powerful because insiders control part of the security check; and implementation-level (side-channel) attacks, which exploit imperfect sources, detectors and local oscillators. For each class, we describe the attack mechanism, representative protocols that were broken, and the countermeasures that followed, such as decoy states, one-way transmission with wavelength filtering, measurement-device-independent (MDI) and device-independent (DI) QSS, and composable finite-key proofs that treat dishonest players as adversaries. We conclude that the field is converging on a single lesson: a QSS protocol is only as secure as the participant model behind its proof, so security proofs must treat every player as a potential adversary with full access to their own devices. We end with open problems for QSS in quantum networks.
Quantum secret sharing is a basic quantum cryptographic primitive, which has a lot of applications in information security and privacy preservation. An efficient multiparty quantum secret sharing protocol (Kuo et al. in EPJ Quantum Technol 10(1):29, 2023) based on a novel structure and single qubits was reported recently. In this paper, we give a cryptanalysis of this protocol and show that it cannot satisfy the security requirement for secret sharing because an unauthorized set of agents can gain access to some information on the dealer's secret by a special collusion attack. Furthermore, we put forward a way to deal with the security problem.
Abstract In the field of quantum cryptography, Quantum Secret Sharing (QSS) holds substantial importance, with identity authentication emerging as a key strategy for safeguarding information. It efficiently certifies the identification of both persons involved in the conversation, which contributes to increased security measures. Our proposal, a (m, n) threshold Quantum Secret Sharing (QSS) scheme introduces a unique approach to mutual identity authentication, utilizing mutually unbiased bases. During the secret recovery phase, the scheme ensures that secrets exclusively held by participants remain undisclosed and are not transmitted, reinforcing the security of the communication process. As a result, external eavesdroppers are left empty-handed in their attempt to access information about secrets during this phase. Our protocol surpasses in terms of security, effectiveness, and practicality, proving its resilience against intercept–resend attacks, collusion attacks, collective attacks, and forgery attacks according to a comprehensive security analysis.