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

Research on Quantum Secret Sharing Protocol Based on Quantum State Coding

ZHANG Lei, WU Mingxi, LIU Yupeng, ZHANG Qiang, LIAN Shuaishuai, ZHANG Yunxiang

Published Nov 1, 2026• 0 citations
Publisher

Abstract

Quantum secret sharing is an important foundation for building a distributed quantum network security mechanism. Its core lies in utilizing the non-orthogonality, entanglement correlation and measurement perturbation characteristics of quantum states to achieve the secure distribution and recovery of secrets under the condition of multiparty collaboration. As the related protocols and technical branches become increasingly complex, the intrinsic physical connections among different technical routes have been blurred to a certain extent. From the perspective of quantum state encoding resources, this paper provides a systematic review of the physical mechanisms, protocol constructions, and security features of typical quantum state resources in current quantum secret sharing protocols. For discrete-variable systems, it analyzes the operational roles of various resources, including two- and multi-basis encodings, Bell states, GHZ (Greenberger-Horne-Zeilinger) states, W states, graph states, and orthogonal product states, in secret encoding, share distribution, and collaborative recovery processes. For continuous-variable systems, it examines the paradigm differences between Gaussian entangled states and non-Gaussian states in terms of entanglement structure, security modeling, and practical realizability. The paper compares and analyzes the performance characteristics and security thresholds of different quantum state resources across multiple dimensions, such as fidelity, trace distance, entanglement measures, key generation rate, and resource efficiency, and systematically summarizes the security boundaries and detection mechanisms of various protocols under different attack models. It is pointed out that cross-platform compatibility, measurement device-independent architecture, security proof under limited key conditions, and unified performance evaluation for actual noise environments in heterogeneous quantum networks will become important development directions for quantum secret sharing.

DOI
10.3778/j.issn.1673-9418.2604050

Related papers

Research status and prospects of quantum secret sharing

Hua‐Lei Yin, Jianyu SHEN, Nuo Chen +1 more

Quantum secret sharing (QSS), as a quantum extension of classical secret sharing, uses the basic principles of quantum mechanics to share information safely among multiple parties, providing a new paradigm for information security. As a key foundation for secure multiparty quantum communication and distributed quantum computing, QSS has attracted considerable attention since its emergence. Currently, research in this field includes both classical and quantum scenarios, and continuous progress has been made in both theoretical and experimental aspects. This paper first reviews the current development of QSS for classical information. In this regard, significant and parallel progress has been made in both discrete-variable QSS and continuous-variable QSS. The QSS protocols for sharing classical information, from entangled states to single photons and then to coherent light, have been continuously optimized to better utilize available resources and achieve more efficient implementation under current technological conditions. Meanwhile, round-robin, measurement-device-independent, and other protocols have been steadily improving the security of QSS. Next, one will focus on QSS scheme for quantum secrets, which begins with the symmetry of access structures and introduces basic (k, n) threshold protocols, dynamic schemes that support adaptive agent groups, and symmetric quantum information splitting through entanglement. It further introduces hierarchical quantum secret sharing schemes for asymmetric splitting of quantum information. Considering practical laboratory conditions of quantum states as resources, an overall discussion is conducted on quantum secret sharing with graph states. Afterwards, the design of a continuous-variable scheme for quantum secret sharing is outlined, and entanglement state sharing and quantum teleportation between multiple senders and receivers are introduced. Finally, this review discusses and outlines the future development directions of QSS, thereby inspiring readers to further study and explore the relevant subjects.

Acta Physica Sinica•Jan 1, 2025•3 citations

A new non-entangled quantum secret sharing protocol among different nodes in further quantum networks

Si-Jia Fu, Kejia Zhang, Long Zhang +1 more

As an important branch of quantum secure multi-party computation, quantum secret sharing (QSS) can distribute secret information among dishonest network nodes without revealing the secrets. In this study, a new four-party QSS protocol based on locally indistinguishable orthogonal product (LIOP) states is first proposed for quantum network communication. Then, the general multiparty QSS model based on LIOP states will be expanded. Combined with the property of LIOP states and obfuscating operation, the source node can send the secrets to different destination nodes in the quantum network. Accordingly, it is proven that the destination nodes have to work together to recover the shared secrets against some existing attacks. Furthermore, no entangled resources and complicated operations are required in the presented protocol. We hope the results could make positive effects to the development of quantum secure communication in the future.

Frontiers in Physics•Oct 24, 2022•6 citations

Quantum secret sharing with four components based on different entangled state optical fields

FANG Yutong, Yaoyao Zhou, WANG Yukun

Quantum secret sharing (QSS) is one of the important branches of quantum cryptography, which is used to share a secret among multiple participants, and has great potential for applications in fields such as quantum computing and quantum communication. With the rapid development of quantum information, people have higher requirements for the number of users and security of quantum secret sharing. This article analyzes the entanglement characteristics of three entangled states, namely the continuous variable four component Bound Entanglement (BE) state, GHZ (Greenberger-Horn-Zeilinger) state, and Cluster state, and uses them as quantum resources to construct a four component quantum secret sharing scheme. The dependence of quantum secret sharing security on different physical parameters is theoretically calculated for each scheme. The results show that the secret key rate of different entangled state optical fields has a consistent relationship with the signal strength when four users cooperate. While the secret key rate in the BE entangled-state light field corresponding to the QSS scheme is balanced in orthogonal amplitude and orthogonal bit-phase components with a symmetric relationship when three users cooperate, the GHZ entangled-state and the Cluseter entangled-state light field corresponding to the QSS scheme show a larger secret key rate in a single orthogonal component.

•Mar 1, 2026•0 citations

Multi-party quantum secret sharing protocol based on orthogonal product states

Yun Chen, LI Xuanbing, Shuai Li

Quantum secret sharing (QSS) is a cryptographic protocol that utilizes fundamental principles of quantum mechanics to securely distribute and reconstruct secret information among multiple participants. Most existing protocols rely on entangled states (such as Bell and GHZ states), but in practical applications. The preparation of entangled state is constrained by a short quantum coherence time, low state fidelity, etc., which makes it difficult to implement entangled resource-dependent QSS protocols. In this work, a novel practical and verifiable multi-party QSS protocol is proposed based on orthogonal product states, which are easier to prepare than entangled states. During the protocol preparation stage, the secret distributor first converts pre-shared classical secret information into the corresponding orthogonal product states according to the encoding rules, and pre-shares a communication key with participants via quantum key distribution (QKD), which is used to hide the initial quantum sequence information through subsequent particle transformation operations. After preparing the orthogonal product states, the distributor reorganizes the particles by position, extracting particles at the same position from each state to form new sequences, shuffling their order, then applying Hadamard operations using a pre-shared key, inserting decoy particles, and sending the sequences to the participants. After receiving it, participants conduct eavesdropping detection, use the same key for the inverse transformations, retain one particle from each sequence, and sequentially pass the remaining particles until the last participant receives a complete set, triggering state verification with the arbiter distributor. If the verification is successful, the particles will be returned to the first participant and the return stage will follow the same procedure. Only after both the transmission and return stage verifications have passed, will the distributor reveal the initial particle positions, allowing participants to collaboratively reconstruct the secret. In the protocol, the secret distributor acts as an arbitrator to verify the particle state information together with participants at designated points (the end of the transmission stage and the end of the return stage) in order to determine whether the particle-state information is error-free during transmission. If the verification fails at either stage, the protocol will be terminated immediately. Meanwhile, considering that the number of participants may change during the execution of the protocol, a dynamic scheme for personnel changes is designed to ensure the flexibility of the protocol. Through the analysis of possible internal and external attacks, It can be proven that our protocol can effectively resist the existing common attack. Using Qiskit simulation experiments, the core quantum procedures of the protocol can be successfully modeled. The experimental results provide strong computational validation of the theoretical feasibility of the protocol.

Acta Physica Sinica•Jan 1, 2025•0 citations

An Efficient Quantum Secret Sharing Scheme Based on Restricted Threshold Access Structure

Lei Li, Zhi Zhou Li

Quantum secret sharing is an important branch of quantum cryptography, and secure multi-party quantum key distribution protocols can be constructed using quantum secret sharing. In this paper, we construct a quantum secret sharing scheme built on a constrained (t, n ) threshold access structure, where n is the number of participants and t is the threshold number of participants and the distributor. Participants from two different sets perform the corresponding phase shift operations on two particles in the GHZ state passed to them, and then t−1 participants with the distributor can recover the key, where the participant recovering the key measures the particles received by himself and finally obtains the key through the collaboration of the distributors. Security analysis shows that this protocol can be resistant to direct measurement attacks, interception retransmission attacks, and entanglement measurement attacks. This protocol is more secure, flexible, and efficient compared with similar existing protocols, which can save more quantum resources.

Entropy•Jan 31, 2023•12 citations

Sharing Classical Secrets with Continuous-Variable Entanglement: Composable Security and Network Coding Advantage

Nathan Walk, Jens Eisert

Secret sharing is a multiparty cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed).When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bipartite quantum key distribution (QKD) and those that exploit multipartite entanglement.The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis that quantifies their performance in the composable, finite-size regime, which has become the gold standard for QKD security.Given this-and the fact that distributing multipartite entanglement is typically challenging-one might well ask is there any virtue in pursuing multipartite entanglement-based schemes?Here, we answer this question in the affirmative for a class of secret-sharing protocols based on continuous-variable graph states.We establish security in a composable framework and identify a network topology, specifically a bottleneck network of lossy channels, and parameter regimes within the reach of present-day experiments for which a multipartite scheme outperforms the corresponding QKD-based method in the asymptotic and finite-size setting.Finally, we establish experimental parameters where the multipartite schemes outperform any possible QKD-based protocol.This is one of the first concrete compelling examples of multipartite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication and represents a rigorous, operational benchmark to assess the usefulness of such resources.

arXiv:2104.10659•PRX Quantum•Nov 22, 2021•24 citations
Quantum secret sharing is an important foundation for building a distributed quantum network security mechanism. Its core lies in utilizing the non-orthogonality, entanglement correlation and measurement perturbation characteristics of quantum states to achieve the secure distribution and recovery of secrets under the condition of multiparty collaboration. As the related protocols and technical branches become increasingly complex, the intrinsic physical connections among different technical routes have been blurred to a certain extent. From the perspective of quantum state encoding resources, this paper provides a systematic review of the physical mechanisms, protocol constructions, and security features of typical quantum state resources in current quantum secret sharing protocols. For discrete-variable systems, it analyzes the operational roles of various resources, including two- and multi-basis encodings, Bell states, GHZ (Greenberger-Horne-Zeilinger) states, W states, graph states, and orthogonal product states, in secret encoding, share distribution, and collaborative recovery processes. For continuous-variable systems, it examines the paradigm differences between Gaussian entangled states and non-Gaussian states in terms of entanglement structure, security modeling, and practical realizability. The paper compares and analyzes the performance characteristics and security thresholds of different quantum state resources across multiple dimensions, such as fidelity, trace distance, entanglement measures, key generation rate, and resource efficiency, and systematically summarizes the security boundaries and detection mechanisms of various protocols under different attack models. It is pointed out that cross-platform compatibility, measurement device-independent architecture, security proof under limited key conditions, and unified performance evaluation for actual noise environments in heterogeneous quantum networks will become important development directions for quantum secret sharing.
Quantum secret sharing (QSS), as a quantum extension of classical secret sharing, uses the basic principles of quantum mechanics to share information safely among multiple parties, providing a new paradigm for information security. As a key foundation for secure multiparty quantum communication and distributed quantum computing, QSS has attracted considerable attention since its emergence. Currently, research in this field includes both classical and quantum scenarios, and continuous progress has been made in both theoretical and experimental aspects. This paper first reviews the current development of QSS for classical information. In this regard, significant and parallel progress has been made in both discrete-variable QSS and continuous-variable QSS. The QSS protocols for sharing classical information, from entangled states to single photons and then to coherent light, have been continuously optimized to better utilize available resources and achieve more efficient implementation under current technological conditions. Meanwhile, round-robin, measurement-device-independent, and other protocols have been steadily improving the security of QSS. Next, one will focus on QSS scheme for quantum secrets, which begins with the symmetry of access structures and introduces basic (k, n) threshold protocols, dynamic schemes that support adaptive agent groups, and symmetric quantum information splitting through entanglement. It further introduces hierarchical quantum secret sharing schemes for asymmetric splitting of quantum information. Considering practical laboratory conditions of quantum states as resources, an overall discussion is conducted on quantum secret sharing with graph states. Afterwards, the design of a continuous-variable scheme for quantum secret sharing is outlined, and entanglement state sharing and quantum teleportation between multiple senders and receivers are introduced. Finally, this review discusses and outlines the future development directions of QSS, thereby inspiring readers to further study and explore the relevant subjects.
As an important branch of quantum secure multi-party computation, quantum secret sharing (QSS) can distribute secret information among dishonest network nodes without revealing the secrets. In this study, a new four-party QSS protocol based on locally indistinguishable orthogonal product (LIOP) states is first proposed for quantum network communication. Then, the general multiparty QSS model based on LIOP states will be expanded. Combined with the property of LIOP states and obfuscating operation, the source node can send the secrets to different destination nodes in the quantum network. Accordingly, it is proven that the destination nodes have to work together to recover the shared secrets against some existing attacks. Furthermore, no entangled resources and complicated operations are required in the presented protocol. We hope the results could make positive effects to the development of quantum secure communication in the future.
Quantum secret sharing (QSS) is one of the important branches of quantum cryptography, which is used to share a secret among multiple participants, and has great potential for applications in fields such as quantum computing and quantum communication. With the rapid development of quantum information, people have higher requirements for the number of users and security of quantum secret sharing. This article analyzes the entanglement characteristics of three entangled states, namely the continuous variable four component Bound Entanglement (BE) state, GHZ (Greenberger-Horn-Zeilinger) state, and Cluster state, and uses them as quantum resources to construct a four component quantum secret sharing scheme. The dependence of quantum secret sharing security on different physical parameters is theoretically calculated for each scheme. The results show that the secret key rate of different entangled state optical fields has a consistent relationship with the signal strength when four users cooperate. While the secret key rate in the BE entangled-state light field corresponding to the QSS scheme is balanced in orthogonal amplitude and orthogonal bit-phase components with a symmetric relationship when three users cooperate, the GHZ entangled-state and the Cluseter entangled-state light field corresponding to the QSS scheme show a larger secret key rate in a single orthogonal component.
Quantum secret sharing (QSS) is a cryptographic protocol that utilizes fundamental principles of quantum mechanics to securely distribute and reconstruct secret information among multiple participants. Most existing protocols rely on entangled states (such as Bell and GHZ states), but in practical applications. The preparation of entangled state is constrained by a short quantum coherence time, low state fidelity, etc., which makes it difficult to implement entangled resource-dependent QSS protocols. In this work, a novel practical and verifiable multi-party QSS protocol is proposed based on orthogonal product states, which are easier to prepare than entangled states. During the protocol preparation stage, the secret distributor first converts pre-shared classical secret information into the corresponding orthogonal product states according to the encoding rules, and pre-shares a communication key with participants via quantum key distribution (QKD), which is used to hide the initial quantum sequence information through subsequent particle transformation operations. After preparing the orthogonal product states, the distributor reorganizes the particles by position, extracting particles at the same position from each state to form new sequences, shuffling their order, then applying Hadamard operations using a pre-shared key, inserting decoy particles, and sending the sequences to the participants. After receiving it, participants conduct eavesdropping detection, use the same key for the inverse transformations, retain one particle from each sequence, and sequentially pass the remaining particles until the last participant receives a complete set, triggering state verification with the arbiter distributor. If the verification is successful, the particles will be returned to the first participant and the return stage will follow the same procedure. Only after both the transmission and return stage verifications have passed, will the distributor reveal the initial particle positions, allowing participants to collaboratively reconstruct the secret. In the protocol, the secret distributor acts as an arbitrator to verify the particle state information together with participants at designated points (the end of the transmission stage and the end of the return stage) in order to determine whether the particle-state information is error-free during transmission. If the verification fails at either stage, the protocol will be terminated immediately. Meanwhile, considering that the number of participants may change during the execution of the protocol, a dynamic scheme for personnel changes is designed to ensure the flexibility of the protocol. Through the analysis of possible internal and external attacks, It can be proven that our protocol can effectively resist the existing common attack. Using Qiskit simulation experiments, the core quantum procedures of the protocol can be successfully modeled. The experimental results provide strong computational validation of the theoretical feasibility of the protocol.
Quantum secret sharing is an important branch of quantum cryptography, and secure multi-party quantum key distribution protocols can be constructed using quantum secret sharing. In this paper, we construct a quantum secret sharing scheme built on a constrained (t, n ) threshold access structure, where n is the number of participants and t is the threshold number of participants and the distributor. Participants from two different sets perform the corresponding phase shift operations on two particles in the GHZ state passed to them, and then t−1 participants with the distributor can recover the key, where the participant recovering the key measures the particles received by himself and finally obtains the key through the collaboration of the distributors. Security analysis shows that this protocol can be resistant to direct measurement attacks, interception retransmission attacks, and entanglement measurement attacks. This protocol is more secure, flexible, and efficient compared with similar existing protocols, which can save more quantum resources.
Secret sharing is a multiparty cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed).When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bipartite quantum key distribution (QKD) and those that exploit multipartite entanglement.The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis that quantifies their performance in the composable, finite-size regime, which has become the gold standard for QKD security.Given this-and the fact that distributing multipartite entanglement is typically challenging-one might well ask is there any virtue in pursuing multipartite entanglement-based schemes?Here, we answer this question in the affirmative for a class of secret-sharing protocols based on continuous-variable graph states.We establish security in a composable framework and identify a network topology, specifically a bottleneck network of lossy channels, and parameter regimes within the reach of present-day experiments for which a multipartite scheme outperforms the corresponding QKD-based method in the asymptotic and finite-size setting.Finally, we establish experimental parameters where the multipartite schemes outperform any possible QKD-based protocol.This is one of the first concrete compelling examples of multipartite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication and represents a rigorous, operational benchmark to assess the usefulness of such resources.