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:2412.11667 · IEEE Transactions on Quantum Engineering

Security and Fairness in Multiparty Quantum Secret Sharing Protocol

Alessio Di Santo, Walter Tiberti, Dajana Cassioli

Published Jan 1, 2025• 10 citations
arXivHTMLPDF

Abstract

Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all the$n$players calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset of$t$players, out of the entire set on$n$players, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.

DOI
10.1109/tqe.2025.3535823

Related papers

QUANTUM SECRET SHARING PROTOCOL SECURITY IN CLOUD ENVIRONMENT

E. MOUNIKA REDDY1 , VOLLALA VYSHNAVI2 , VEMIREDDY SARANYA REDDY3 , VINODRAO RASHMIN TEZ4 , MARPALLY SHIVANI5

Quantum Secret Sharing (QSS) is an essential cryptographic primitive that distributes a secret among multiple parties using quantum information, ensuring that only authorized subsets of participants can reconstruct the secret. Existing QSS approaches predominantly rely on conventional network topologies and maximally entangled states such as the often requiring full participation of all key aspects such as redundancy, authentication, and privacy. In this work, we propose a novel QSS framework built on a generic distributed quantum network that incorporates a threshold-based scheme, allowing any t out of n players to collaboratively reconstruct the secret. Our protocol introduces a custom weighting system and a quantum variant of Dijkstra’s algorithm to dynamically select the optimal subset of players, enhancing flexibility and performance. Furthermore, we integrate CRYSTAL-Kyber post-quantum cryptographic primitives to provide robust user authentication and identity obfuscation, thereby bolstering security and privacy. Through comprehensive security analysis and simulations, we demonstrate that our protocol outperforms traditional QSS models, offering improved resilience against both classical and quantum adversarial threats.

International Journal of Engineering Research and Science & Technology•Jun 30, 2026•0 citations

A novel verifiable weighted threshold quantum secret sharing scheme

Yumin Dong, Yi Luo, Yanying Fu

Abstract Threshold quantum secret sharing is a cryptography technique for dividing and reconstructing secret information. The dealer shares a secret based on quantum mechanics principles, and a subset of participants cooperate to recover that secret. For example, in k , n quantum threshold scheme and n , n quantum threshold scheme, the former can only reconstruct the secret when at least k shares are collected. The latter requires all n shares to be collected to reconstruct the secret. However, in real scenarios, the priority of participant identities may vary. In order to meet the actual needs of participants with different rights, this paper proposes a w , ω , n quantum secret sharing (QSS) scheme. When the sum of participants’ weights w is greater than or equal to a threshold ω, they can cooperate to reconstruct the secret. In order to achieve this, this paper uses the entangled state of single particles and constructs a verifiable QSS scheme based on the Chinese remainder theorem. Significantly, in case of a dishonest participant, the dealer can delete the participant before recovering the secret to ensure the security of the communication. This scheme is more flexible than other threshold protocols. At the same time, it reduces the communication cost of the participants. In addition, security analysis shows that the scheme resists typical external and internal attacks.

Physica Scripta•Apr 21, 2023•7 citations

A quantum secret-sharing protocol with fairness

Feng Liu, Su‐Juan Qin, Qiaoyan Wen

A quantum secret-sharing (QSS) protocol consists of two main phases, called sharing and reconstruction. In the first phase, the dealer selects a secret, divides it into several shares, and sends each participant its share securely with a quantum channel. In the second phase, the participants run an interactive protocol in order to reconstruct the secret. If the participants can communicate via a broadcast channel, they can show their shares and learn the secrets simultaneously. So what happens if the channel is not simultaneous? In this paper, we propose a QSS protocol with cheaters by using partially and maximally entangled states. A secure and fair reconstruction mechanism is designed, in a way that each participant can learn or cannot learn the secret simultaneously.

Physica Scripta•Jun 6, 2014•28 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

Enhanced Quantum Secret Sharing with Reduced Resource Consumption through GHZ Entanglement

Shu–Yu Kuo, Chia‐Lin Liu, Yu-Chi Jiang +2 more

Quantum secret sharing (QSS) is a crucial quantum cryptographic method that provides unconditional secu-rity through the principles of quantum mechanics and enables practical applications in information security and distributed computing. Many QSS protocols have been proposed based on various quantum properties and operations. In this study, we propose a new and efficient multiparty quantum secret sharing protocol that utilizes entanglement swapping with the Greenberger-Horne-Zeilinger (GHZ) state and introduces a novel structure to efficiently and securely distribute and recover secrets. Due to entanglement swapping, participants can entangle systems without directly interacting with each other, enhancing practical usage. Through GHZ entanglement swapping, initial particle states cannot be directly inferred. The proposed QSS protocol leverages this property to encode information among participants. To decode the secret, participants only require measuring particles on a GHZ basis to get the corresponding information without performing operations. Through security analysis, it is shown that any eavesdropper or dishonest participant will be detected. Efficiency analysis indicates that the proposed protocol substantially reduces costs and significantly enhances efficiency. As the number of participants increases, the resource consumption of the proposed protocol becomes much lower than that of other QSS protocols. In summary, the proposed protocol efficiently achieves unconditional security in QSS, ensuring the secure transmission and sharing of quantum information.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•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•1 citation
Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all thennnplayers calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset oftttplayers, out of the entire set onnnnplayers, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.
Quantum Secret Sharing (QSS) is an essential cryptographic primitive that distributes a secret among multiple parties using quantum information, ensuring that only authorized subsets of participants can reconstruct the secret. Existing QSS approaches predominantly rely on conventional network topologies and maximally entangled states such as the often requiring full participation of all key aspects such as redundancy, authentication, and privacy. In this work, we propose a novel QSS framework built on a generic distributed quantum network that incorporates a threshold-based scheme, allowing any t out of n players to collaboratively reconstruct the secret. Our protocol introduces a custom weighting system and a quantum variant of Dijkstra’s algorithm to dynamically select the optimal subset of players, enhancing flexibility and performance. Furthermore, we integrate CRYSTAL-Kyber post-quantum cryptographic primitives to provide robust user authentication and identity obfuscation, thereby bolstering security and privacy. Through comprehensive security analysis and simulations, we demonstrate that our protocol outperforms traditional QSS models, offering improved resilience against both classical and quantum adversarial threats.
Abstract Threshold quantum secret sharing is a cryptography technique for dividing and reconstructing secret information. The dealer shares a secret based on quantum mechanics principles, and a subset of participants cooperate to recover that secret. For example, in k , n quantum threshold scheme and n , n quantum threshold scheme, the former can only reconstruct the secret when at least k shares are collected. The latter requires all n shares to be collected to reconstruct the secret. However, in real scenarios, the priority of participant identities may vary. In order to meet the actual needs of participants with different rights, this paper proposes a w , ω , n quantum secret sharing (QSS) scheme. When the sum of participants’ weights w is greater than or equal to a threshold ω, they can cooperate to reconstruct the secret. In order to achieve this, this paper uses the entangled state of single particles and constructs a verifiable QSS scheme based on the Chinese remainder theorem. Significantly, in case of a dishonest participant, the dealer can delete the participant before recovering the secret to ensure the security of the communication. This scheme is more flexible than other threshold protocols. At the same time, it reduces the communication cost of the participants. In addition, security analysis shows that the scheme resists typical external and internal attacks.
A quantum secret-sharing (QSS) protocol consists of two main phases, called sharing and reconstruction. In the first phase, the dealer selects a secret, divides it into several shares, and sends each participant its share securely with a quantum channel. In the second phase, the participants run an interactive protocol in order to reconstruct the secret. If the participants can communicate via a broadcast channel, they can show their shares and learn the secrets simultaneously. So what happens if the channel is not simultaneous? In this paper, we propose a QSS protocol with cheaters by using partially and maximally entangled states. A secure and fair reconstruction mechanism is designed, in a way that each participant can learn or cannot learn the secret simultaneously.
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 (QSS) is a crucial quantum cryptographic method that provides unconditional secu-rity through the principles of quantum mechanics and enables practical applications in information security and distributed computing. Many QSS protocols have been proposed based on various quantum properties and operations. In this study, we propose a new and efficient multiparty quantum secret sharing protocol that utilizes entanglement swapping with the Greenberger-Horne-Zeilinger (GHZ) state and introduces a novel structure to efficiently and securely distribute and recover secrets. Due to entanglement swapping, participants can entangle systems without directly interacting with each other, enhancing practical usage. Through GHZ entanglement swapping, initial particle states cannot be directly inferred. The proposed QSS protocol leverages this property to encode information among participants. To decode the secret, participants only require measuring particles on a GHZ basis to get the corresponding information without performing operations. Through security analysis, it is shown that any eavesdropper or dishonest participant will be detected. Efficiency analysis indicates that the proposed protocol substantially reduces costs and significantly enhances efficiency. As the number of participants increases, the resource consumption of the proposed protocol becomes much lower than that of other QSS protocols. In summary, the proposed protocol efficiently achieves unconditional security in QSS, ensuring the secure transmission and sharing of quantum information.
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.