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:2610.10176

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

Santanu Majhi, Nirupam Basak

cs.CRquant-phSubmitted Oct 7, 2026• Announced Oct 8, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

The paper studies whether semi-quantum secret sharing can protect a classical secret when a quantum assisting server colludes with one recipient. It analyzes a two-recipient protocol in which a semi-quantum dealer distributes secret shares using two quantum servers. A colluding recipient–server coalition can measure the other recipient’s entire stream in the $Z$ basis, falsify server-controlled decoy checks, and recover the missing key after its positions are announced. A replacement protocol uses one quantum server, Bell-state encoding, dealer-inserted $Z$-basis key qubits and BB84 decoys, and secret permutations pre-shared between the dealer and each recipient. Recipients permute the decoys and randomly measure or reflect them. The server reports measurement outcomes before recipients disclose their operation choices; the dealer evaluates the checks. The paper claims information-theoretic security against recipient–server collusion. Its argument combines one-time-pad secrecy, conditional on the other recipient’s key remaining private, with disturbance calculations for interception, double-CNOT, entangle–measure, and decoy-substitution attacks. For interception of the entire stream, it gives an escape probability $(3/4)^{m/2}$ for $m$ decoys, assuming equally likely reflection and measurement and approximately half diagonal-basis decoys. The stated qubit efficiency is $n/(4n+2m)$ for an $n$-bit secret. The construction addresses two recipients and requires pre-shared secret permutations. Generalization to larger networks, heterogeneous participant capabilities, and practical resource optimization are identified as future directions.

Likely largely AI-generatedOverclaimsIncrementalStrong assumptionsPossible error

Central claim may not hold: A Bob–Trent coalition can use one shared CNOT probe to cancel all returned decoy contributions independently of their permutation and learn the secret's parity without changing any decoy-test statistics, contradicting information-theoretic secrecy. The Entangle-Measure analysis mistakes perfect probe distinguishability for the requirement to obtain any information and provides no secrecy guarantee for partial-information attacks accepted below a nonzero QBER threshold. The Double CNOT analysis incorrectly claims that a second CNOT restores coherence destroyed by SIFT measurement and gives an escape probability incompatible with its own mode probabilities. The efficiency calculation matches the corrected predecessor's efficiency but supplies no bound establishing the claimed resource optimality.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

An efficient multiparty semi-quantum secret sharing protocol using single photons

Chung-Yung Huang, Jason Lin

This study proposes a multiparty single-photon semi-quantum secret sharing (SQSS) protocol to simultaneously improve quantum bit (qubit) efficiency and practical feasibility. Existing quantum secret sharing protocols typically assume that all participants possess full quantum capabilities, which limits their deployment in real-world environments. To address this issue, the proposed protocol was designed using a semi-quantum model, allowing N agents with limited quantum capabilities to participate in the secret-sharing process. In terms of efficiency, the proposed protocol employs single photons as quantum resources and is analyzed under a unified definition of qubit efficiency. The results show that the qubit efficiency of the proposed protocol reaches \(\frac{1}{2N}\) , which is comparable to the best recent quantum secret sharing protocols and outperforms most existing SQSS methods. Unlike certain protocols in which qubit efficiency decreases exponentially with the number of participants, the quantum resource consumption of the proposed protocol increases linearly with the number of agents. Consequently, its qubit efficiency decreases proportionally to \(\frac{1}{N}\) , rather than exponentially, providing better scalability as the number of agents increases. In terms of security, the protocol is analyzed against several attack models, including intercept-resend, entangle-and-measure, collective, and collusion attacks. The analysis shows that an adversary cannot obtain useful information without detection under these attacks, demonstrating the robustness of the proposed protocol.

EPJ Quantum Technology•Oct 21, 2026•0 citations

A Semi-Quantum Secret-Sharing Protocol with a High Channel Capacity

Yuan Tian, Genqing Bian, Jinyong Chang +3 more

Semi-quantum cryptography communication stipulates that the quantum user has complete quantum capabilities, and the classical user has limited quantum capabilities, only being able to perform the following operations: (1) measuring and preparing qubits with a Z basis and (2) returning qubits without any processing. Secret sharing requires participants to work together to obtain complete secret information, which ensures the security of the secret information. In the semi-quantum secret sharing (SQSS) protocol, the quantum user Alice divides the secret information into two parts and gives them to two classical participants. Only when they cooperate can they obtain Alice's original secret information. The quantum states with multiple degrees of freedom (DoFs) are defined as hyper-entangled states. Based on the hyper-entangled single-photon states, an efficient SQSS protocol is proposed. The security analysis proves that the protocol can effectively resist well-known attacks. Compared with the existing protocols, this protocol uses hyper-entangled states to expand the channel capacity. The transmission efficiency is 100% higher than that of single-degree-of-freedom (DoF) single-photon states, providing an innovative scheme for the design of the SQSS protocol in quantum communication networks. This research also provides a theoretical basis for the practical application of semi-quantum cryptography communication.

Entropy•Apr 30, 2023•20 citations

An Efficient and Secure Semi-Quantum Secret Sharing Scheme Based on W State Sharing of Specific Bits

Kai Xing, Rongbo Lu, Sihai Liu +1 more

This paper presents a semi-quantum secret sharing (SQSS) protocol based on three-particle W states, designed for efficient and secure secret sharing in quantum-resource-constrained scenarios. In the protocol, a fully quantum-capable sender encodes binary secrets using W, while receivers with limited quantum capabilities reconstruct the secret through collaborative Z basis measurements and classical communication, ensuring no single participant can obtain the complete information independently. The protocol employs a four-state decoy photon technique ({|0⟩,|1⟩,|+⟩,|−⟩}) and position randomization, combined with photon number splitting (PNS) and wavelength filtering (WF) technologies, to resist intercept–resend, entanglement–measurement, and double controlled-NOT(CNOT) attacks. Theoretical analysis shows that the detection probability of intercept–resend attacks increases exponentially with the number of decoy photons (approaching 1). For entanglement–measurement attacks, any illegal operation by an attacker introduces detectable quantum state disturbances. Double CNOT attacks are rendered ineffective by the untraceability of particle positions and mixed-basis strategies. Leveraging the robust entanglement of W states, the protocol proves that the mutual information between secret bits and single-participant measurement results is strictly zero, ensuring lossless reconstruction only through authorized collaboration.

Entropy•Oct 26, 2025•2 citations

Semi-quantum secret sharing protocol with specific bits based on third party

Zhiwei Ma, Jing Li, Xianmin Wang +1 more

Abstract The fundamental concept of secret sharing involves dividing a secret into multiple parts and distributing them among several participants, who collectively safeguard the secret. When it comes to restoring the secret, cooperation among specific participants is necessary to reconstruct the original secret. Quantum secret sharing (QSS) employs quantum methods to address some limitations of classical secret sharing. Semi-QSS, an advancement of quantum methods, requires fewer quantum resources. Previous semi-quantum protocols demanded at least one participant with full quantum capabilities and randomly generated secret information. This paper introduces a protocol allowing three participants lacking complete quantum capabilities to share secret information of specific bits with the assistance of a third party possessing complete quantum capabilities. Unlike previous approaches, this protocol does not require participants to possess full quantum capabilities and shares secret information of specific bits. These characteristics make the protocol more practical and flexible for real-world applications.

Laser Physics Letters•Oct 18, 2024•6 citations

Multiparty Mediated Semi-Quantum Secret Sharing Protocol.

Chia‐Wei Tsai, Chun‐Wei Yang, Jason Lin

This study proposes the first multiparty mediated semi-quantum secret sharing (MSQSS) protocol to overcome two existing challenges in current semi-quantum secret sharing protocols: (1) dealer must be the quantum user, and (2) classical users must be equipped with Trojan horse detectors. In the proposed MSQSS protocol, a classical dealer can share secrets with multiple classical agents via the help of a dishonest quantum third party. Security analysis is performed to prove that the proposed protocol cannot suffer from a collective attack, a collusion attack, or a Trojan horse attack. Furthermore, the proposed MSQSS protocol is more lightweight than existing SQSS protocols because the classical user is equipped with only two quantum capabilities.

•Feb 13, 2021•1 citation

Circular Semi-Quantum Secret Sharing Using Single Particles*

Chong‐Qiang Ye, Tian-Yu Ye

Abstract Semi-quantum secret sharing (SQSS) is an important branch of semi-quantum cryptography, and differs from quantum secret sharing (QSS) in that not all parties are required to possess quantum capabilities. All previous SQSS protocols have three common features: (i) they adopt product states or entangled states as initial quantum resource; (ii) the particles prepared by quantum party are transmitted in a tree-type way; and (iii) they require the classical parties to possess the measurement capability. In this paper, two circular SQSS protocols with single particles are suggested, where the first one requires the classical parties to possess the measurement capability while the second one does not have this requirement. Compared with the previous SQSS protocols, the proposed SQSS protocols have some distinct features: (i) they adopt single particles rather than product states or entangled states as initial quantum resource; (ii) the particles prepared by quantum party are transmitted in a circular way; and (iii) the second protocol releases the classical parties from the measurement capability. The proposed SQSS protocols are robust against some famous attacks from an eavesdropper, such as the measure-resend attack, the intercept-resend attack and the entangle-measure attack, and are feasible with present quantum technologies in reality .

arXiv:2205.05558•Communications in Theoretical Physics•Dec 1, 2018•45 citations
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.
The paper studies whether semi-quantum secret sharing can protect a classical secret when a quantum assisting server colludes with one recipient. It analyzes a two-recipient protocol in which a semi-quantum dealer distributes secret shares using two quantum servers. A colluding recipient–server coalition can measure the other recipient’s entire stream in the ZZZ basis, falsify server-controlled decoy checks, and recover the missing key after its positions are announced.
A replacement protocol uses one quantum server, Bell-state encoding, dealer-inserted ZZZ-basis key qubits and BB84 decoys, and secret permutations pre-shared between the dealer and each recipient. Recipients permute the decoys and randomly measure or reflect them. The server reports measurement outcomes before recipients disclose their operation choices; the dealer evaluates the checks.
The paper claims information-theoretic security against recipient–server collusion. Its argument combines one-time-pad secrecy, conditional on the other recipient’s key remaining private, with disturbance calculations for interception, double-CNOT, entangle–measure, and decoy-substitution attacks. For interception of the entire stream, it gives an escape probability (3/4)m/2(3/4)^{m/2}(3/4)m/2 for mmm decoys, assuming equally likely reflection and measurement and approximately half diagonal-basis decoys. The stated qubit efficiency is n/(4n+2m)n/(4n+2m)n/(4n+2m) for an nnn-bit secret.
The construction addresses two recipients and requires pre-shared secret permutations. Generalization to larger networks, heterogeneous participant capabilities, and practical resource optimization are identified as future directions.
This study proposes a multiparty single-photon semi-quantum secret sharing (SQSS) protocol to simultaneously improve quantum bit (qubit) efficiency and practical feasibility. Existing quantum secret sharing protocols typically assume that all participants possess full quantum capabilities, which limits their deployment in real-world environments. To address this issue, the proposed protocol was designed using a semi-quantum model, allowing N agents with limited quantum capabilities to participate in the secret-sharing process. In terms of efficiency, the proposed protocol employs single photons as quantum resources and is analyzed under a unified definition of qubit efficiency. The results show that the qubit efficiency of the proposed protocol reaches 12N\frac{1}{2N}2N1​ , which is comparable to the best recent quantum secret sharing protocols and outperforms most existing SQSS methods. Unlike certain protocols in which qubit efficiency decreases exponentially with the number of participants, the quantum resource consumption of the proposed protocol increases linearly with the number of agents. Consequently, its qubit efficiency decreases proportionally to 1N\frac{1}{N}N1​ , rather than exponentially, providing better scalability as the number of agents increases. In terms of security, the protocol is analyzed against several attack models, including intercept-resend, entangle-and-measure, collective, and collusion attacks. The analysis shows that an adversary cannot obtain useful information without detection under these attacks, demonstrating the robustness of the proposed protocol.
Semi-quantum cryptography communication stipulates that the quantum user has complete quantum capabilities, and the classical user has limited quantum capabilities, only being able to perform the following operations: (1) measuring and preparing qubits with a Z basis and (2) returning qubits without any processing. Secret sharing requires participants to work together to obtain complete secret information, which ensures the security of the secret information. In the semi-quantum secret sharing (SQSS) protocol, the quantum user Alice divides the secret information into two parts and gives them to two classical participants. Only when they cooperate can they obtain Alice's original secret information. The quantum states with multiple degrees of freedom (DoFs) are defined as hyper-entangled states. Based on the hyper-entangled single-photon states, an efficient SQSS protocol is proposed. The security analysis proves that the protocol can effectively resist well-known attacks. Compared with the existing protocols, this protocol uses hyper-entangled states to expand the channel capacity. The transmission efficiency is 100% higher than that of single-degree-of-freedom (DoF) single-photon states, providing an innovative scheme for the design of the SQSS protocol in quantum communication networks. This research also provides a theoretical basis for the practical application of semi-quantum cryptography communication.
This paper presents a semi-quantum secret sharing (SQSS) protocol based on three-particle W states, designed for efficient and secure secret sharing in quantum-resource-constrained scenarios. In the protocol, a fully quantum-capable sender encodes binary secrets using W, while receivers with limited quantum capabilities reconstruct the secret through collaborative Z basis measurements and classical communication, ensuring no single participant can obtain the complete information independently. The protocol employs a four-state decoy photon technique ({|0⟩,|1⟩,|+⟩,|−⟩}) and position randomization, combined with photon number splitting (PNS) and wavelength filtering (WF) technologies, to resist intercept–resend, entanglement–measurement, and double controlled-NOT(CNOT) attacks. Theoretical analysis shows that the detection probability of intercept–resend attacks increases exponentially with the number of decoy photons (approaching 1). For entanglement–measurement attacks, any illegal operation by an attacker introduces detectable quantum state disturbances. Double CNOT attacks are rendered ineffective by the untraceability of particle positions and mixed-basis strategies. Leveraging the robust entanglement of W states, the protocol proves that the mutual information between secret bits and single-participant measurement results is strictly zero, ensuring lossless reconstruction only through authorized collaboration.
Abstract The fundamental concept of secret sharing involves dividing a secret into multiple parts and distributing them among several participants, who collectively safeguard the secret. When it comes to restoring the secret, cooperation among specific participants is necessary to reconstruct the original secret. Quantum secret sharing (QSS) employs quantum methods to address some limitations of classical secret sharing. Semi-QSS, an advancement of quantum methods, requires fewer quantum resources. Previous semi-quantum protocols demanded at least one participant with full quantum capabilities and randomly generated secret information. This paper introduces a protocol allowing three participants lacking complete quantum capabilities to share secret information of specific bits with the assistance of a third party possessing complete quantum capabilities. Unlike previous approaches, this protocol does not require participants to possess full quantum capabilities and shares secret information of specific bits. These characteristics make the protocol more practical and flexible for real-world applications.
This study proposes the first multiparty mediated semi-quantum secret sharing (MSQSS) protocol to overcome two existing challenges in current semi-quantum secret sharing protocols: (1) dealer must be the quantum user, and (2) classical users must be equipped with Trojan horse detectors. In the proposed MSQSS protocol, a classical dealer can share secrets with multiple classical agents via the help of a dishonest quantum third party. Security analysis is performed to prove that the proposed protocol cannot suffer from a collective attack, a collusion attack, or a Trojan horse attack. Furthermore, the proposed MSQSS protocol is more lightweight than existing SQSS protocols because the classical user is equipped with only two quantum capabilities.
Abstract Semi-quantum secret sharing (SQSS) is an important branch of semi-quantum cryptography, and differs from quantum secret sharing (QSS) in that not all parties are required to possess quantum capabilities. All previous SQSS protocols have three common features: (i) they adopt product states or entangled states as initial quantum resource; (ii) the particles prepared by quantum party are transmitted in a tree-type way; and (iii) they require the classical parties to possess the measurement capability. In this paper, two circular SQSS protocols with single particles are suggested, where the first one requires the classical parties to possess the measurement capability while the second one does not have this requirement. Compared with the previous SQSS protocols, the proposed SQSS protocols have some distinct features: (i) they adopt single particles rather than product states or entangled states as initial quantum resource; (ii) the particles prepared by quantum party are transmitted in a circular way; and (iii) the second protocol releases the classical parties from the measurement capability. The proposed SQSS protocols are robust against some famous attacks from an eavesdropper, such as the measure-resend attack, the intercept-resend attack and the entangle-measure attack, and are feasible with present quantum technologies in reality .