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

International Journal of Quantum Information

An asymmetric dynamic multiparty quantum secret sharing against active attacks

Ming‐Ming Wang, Xing-Yu Kong

Published Apr 1, 2020• 6 citations
Publisher

Abstract

We propose a dynamic quantum secret sharing (DQSS) protocol based on traveling single-qubits where any number of players can join or leave the protocol according to the dealer’s and players’ will. The protocol can resist collusion attacks of dishonest players by using an honesty test based on some unambiguous unitary operations. Specifically, the proposed protocol is secure against active attacks from dishonest players, which is different from existing protocols that consider only passive attacks based on the assumption that players are honest but curious. By using the asymmetric strategy, the efficiency of our DQSS protocol can be made asymptotically close to 100%. Compared with previous DQSS protocols, our protocol is securer, more efficient and more practical.

DOI
10.1142/s021974992050001x

Related papers

An Efficient Simulation of Quantum Secret Sharing

Kartick Sutradhar, Hari Om

In quantum cryptography, quantum secret sharing $(QSS)$ is a fundamental primitive. $QSS$ can be used to create complex and secure multiparty quantum protocols. Existing $QSS$ protocols are either at the $(n, n)$ threshold $2$ level or at the $(t, n)$ threshold $d$ level with a trusted player, where $n$ denotes the number of players and $t$ denotes the threshold number of players. Here, we propose a secure $d$-level $QSS$ protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing $QSS$ protocols: $(n, n)$ threshold $2$-level and $(t,n)$ threshold $d$-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.

arXiv:2103.11206•Mar 20, 2021•7 citations

A Verifiable Dynamic (t,n) Threshold Quantum Secret Sharing Protocol with Authentication

J. -C. Li, Ming‐Ming Wang

Abstract Quantum secret sharing (QSS) plays a crucial role in quantum cryptography as a privacy preserving scheme. Designing an efficient QSS protocol requires addressing three key challenges: 1) dynamic agent membership (handling agents joining or leaving during execution), 2) adversarial resilience (ensuring robustness against dishonest agents), and 3) practical optimization (improving computational and communication efficiency while minimizing implementation cost). In this paper, a verifiable dynamic threshold QSS (VDQSS) protocol with authentication capability is proposed. The protocol employs single particles for both authentication and share distribution, combining homogeneous linear recursion (HLR) with mutually unbiased bases (MUBs) to reconstruct multiple secrets. This approach significantly enhances security while reducing protocol complexity. The correctness and practicality of the protocol are validated through experimental simulations. Analytical results demonstrate its robustness against common attacks, providing reliable security guarantees for quantum communications. Compared to existing QSS protocols, the protocol offers enhanced simplicity and practical applicability.

Advanced Quantum Technologies•Sep 4, 2025•3 citations

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

Verifiable dynamic (t, n) threshold quantum secret sharing

Jian-Qiu Li, Ming‐Ming Wang

Abstract Numerous high-quality quantum secret sharing (QSS) protocols have been proposed as integral components of quantum cryptography. However, only a limited number effectively integrate both dynamic and verifiable characteristics. This paper proposes a verifiable dynamic (t, n) QSS protocol based on the asymmetric binary polynomial and the d-dimensional Bell states. In the protocol, the dealer can find out the internal fraudsters by verifying whether an agent has used a correct share. The agents can also verify the correctness of the shares provided by the dealer. Besides, the dealer has the capability to independently adding or revoking of agents without requiring assistance from other agents. Furthermore, the protocol requires at least t agents to recover the secret, which makes the proposed protocol more flexible and practical than existing protocols. Our protocol shows good robustness against the intercept-and-resend, the entangle-and-measure, the internal, and the dishonest revoked agent attacks.

Physica Scripta•Jun 20, 2025•6 citations

Improved dynamic multiparty quantum direct secret sharing protocol based on generalized GHZ states to prevent collusion attack

Chun‐Wei Yang, Chia‐Wei Tsai

In 2018, Song et al. [Quantum Inf. Process 17, 244 (2018)] proposed a dynamic quantum direct secret sharing (DQDSS) protocol based on generalized GHZ states. However, this protocol is vulnerable to a security problem, known as the collusion attack, using which the dishonest agents can collude to reveal the master key without collaborating with other agents. This security problem, if unaddressed, can prevent the protocol from providing the secret sharing function. Therefore, this study proposes an improved DQDSS protocol to address the security problem in Song et al.’s DQDSS protocol. The proposed DQDSS protocol is resistant to the collusion attack and various other common attacks. Furthermore, the advantages of Song et al.’s DQDSS protocol are retained in the proposed scheme.

Modern Physics Letters A•Nov 27, 2019•14 citations

Security and Fairness in Multiparty Quantum Secret Sharing Protocol

Alessio Di Santo, Walter Tiberti, Dajana Cassioli

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.

arXiv:2412.11667•IEEE Transactions on Quantum Engineering•Jan 1, 2025•10 citations
We propose a dynamic quantum secret sharing (DQSS) protocol based on traveling single-qubits where any number of players can join or leave the protocol according to the dealer’s and players’ will. The protocol can resist collusion attacks of dishonest players by using an honesty test based on some unambiguous unitary operations. Specifically, the proposed protocol is secure against active attacks from dishonest players, which is different from existing protocols that consider only passive attacks based on the assumption that players are honest but curious. By using the asymmetric strategy, the efficiency of our DQSS protocol can be made asymptotically close to 100%. Compared with previous DQSS protocols, our protocol is securer, more efficient and more practical.
In quantum cryptography, quantum secret sharing (QSS)(QSS)(QSS) is a fundamental primitive. QSSQSSQSS can be used to create complex and secure multiparty quantum protocols. Existing QSSQSSQSS protocols are either at the (n,n)(n, n)(n,n) threshold 222 level or at the (t,n)(t, n)(t,n) threshold ddd level with a trusted player, where nnn denotes the number of players and ttt denotes the threshold number of players. Here, we propose a secure ddd-level QSSQSSQSS protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing QSSQSSQSS protocols: (n,n)(n, n)(n,n) threshold 222-level and (t,n)(t,n)(t,n) threshold ddd-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.
Abstract Quantum secret sharing (QSS) plays a crucial role in quantum cryptography as a privacy preserving scheme. Designing an efficient QSS protocol requires addressing three key challenges: 1) dynamic agent membership (handling agents joining or leaving during execution), 2) adversarial resilience (ensuring robustness against dishonest agents), and 3) practical optimization (improving computational and communication efficiency while minimizing implementation cost). In this paper, a verifiable dynamic threshold QSS (VDQSS) protocol with authentication capability is proposed. The protocol employs single particles for both authentication and share distribution, combining homogeneous linear recursion (HLR) with mutually unbiased bases (MUBs) to reconstruct multiple secrets. This approach significantly enhances security while reducing protocol complexity. The correctness and practicality of the protocol are validated through experimental simulations. Analytical results demonstrate its robustness against common attacks, providing reliable security guarantees for quantum communications. Compared to existing QSS protocols, the protocol offers enhanced simplicity and practical applicability.
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.
Abstract Numerous high-quality quantum secret sharing (QSS) protocols have been proposed as integral components of quantum cryptography. However, only a limited number effectively integrate both dynamic and verifiable characteristics. This paper proposes a verifiable dynamic (t, n) QSS protocol based on the asymmetric binary polynomial and the d-dimensional Bell states. In the protocol, the dealer can find out the internal fraudsters by verifying whether an agent has used a correct share. The agents can also verify the correctness of the shares provided by the dealer. Besides, the dealer has the capability to independently adding or revoking of agents without requiring assistance from other agents. Furthermore, the protocol requires at least t agents to recover the secret, which makes the proposed protocol more flexible and practical than existing protocols. Our protocol shows good robustness against the intercept-and-resend, the entangle-and-measure, the internal, and the dishonest revoked agent attacks.
In 2018, Song et al. [Quantum Inf. Process 17, 244 (2018)] proposed a dynamic quantum direct secret sharing (DQDSS) protocol based on generalized GHZ states. However, this protocol is vulnerable to a security problem, known as the collusion attack, using which the dishonest agents can collude to reveal the master key without collaborating with other agents. This security problem, if unaddressed, can prevent the protocol from providing the secret sharing function. Therefore, this study proposes an improved DQDSS protocol to address the security problem in Song et al.’s DQDSS protocol. The proposed DQDSS protocol is resistant to the collusion attack and various other common attacks. Furthermore, the advantages of Song et al.’s DQDSS protocol are retained in the proposed scheme.
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.