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

Acta Physica Sinica

Research status and prospects of quantum secret sharing

Hua‐Lei Yin, Jianyu SHEN, Nuo Chen, Zeng‐Bing Chen

Published Jan 1, 2025• 3 citations
Publisher

Abstract

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.

DOI
10.7498/aps.74.20250586

Related papers

Research on Quantum Secret Sharing Protocol Based on Quantum State Coding

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

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.

•Nov 1, 2026•0 citations

A flexible framework for (n,n) quantum secret sharing

Kuo-Chun Tseng, Wei-Lin Lee, Chi‐Yuan Chen +1 more

With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.

Modern Physics Letters A•Jul 4, 2025•1 citation

Computational Quantum Secret Sharing

Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang +1 more

Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties so that certain subsets can reconstruct the secret, while unauthorized subsets obtain no information. While QSS was introduced over twenty years ago, previous works focused only on existence of perfectly secure schemes, and the share size of the known schemes is exponential even for access structures computed by polynomial size monotone circuits. This stands in contrast to the classical case, where efficient computationally-secure schemes have been long known for all access structures in $\mathsf{monotone~P}$, and one can even obtain shares which are much shorter than the secret which is impossible with perfect security. In this work, we initiate the study of computationally-secure QSS and show that computational assumptions help significantly in building QSS schemes. We present a simple compiler and use it to obtain a large variety results: We construct polynomial-time QSS schemes under standard assumptions for a rich class of access structures. This includes many access structures for which previous results in QSS required exponential share size. We also construct QSS schemes for which the size of the shares is significantly smaller than the size of the secret. As in the classical case, this is impossible with perfect security. We also use our compiler to obtain results beyond computational QSS. In the information-theoretic setting, we improve the share size of perfect QSS schemes for a large class of access structures to $1.5^{n+o(n)}$, improving upon best known schemes and matching the best known result for general access structures in the classical case. Finally, we show construct efficient schemes for all access structures in $\mathsf{P}$ and $\mathsf{NP}$ when the quantum secret sharing scheme is given multiple of copies of the secret.

arXiv:2305.00356•Leibniz international proceedings in informatics•Jan 1, 2023•6 citations

Quantum secret sharing via lagrange interpolation: from static to conditional dynamic threshold

Kuo-Chun Tseng, Wei-Lin Lee, Chi‐Yuan Chen +1 more

Abstract With the rapid development of quantum computing, traditional encryption methods face growing security threats. Quantum Secret Sharing (QSS) has emerged as a promising solution, using quantum principles to improve communication security and prevent internal and external attacks. This study proposes a new (t, n) Threshold Quantum Secret Sharing (TQSS) protocol based on single-qubit unitary operations and Lagrange interpolation. The protocol allows secret reconstruction without third-party or dealer assistance and remains efficient even when some participants are absent. To address more complex real-world scenarios, we extend our previously proposed (t, n) TQSS protocol into a Conditional Dynamic TQSS (CDTQSS). This approach uses resource-based share splitting to allow new participants to join without requiring the dealer to redistribute information. However, the protocol is ‘conditional’ because existing participants must take on extra responsibility-they must assist in generating shares for new members and also participate in the secret reconstruction process together with them. The protocol maintains strong security, reduces resource consumption, and offers better flexibility, making it well-suited for practical and dynamic quantum communication needs.

Physica Scripta•Jun 9, 2025•3 citations

Comparative Analysis of Classical vs Quantum Secret Sharing Schemes

Ajay Kumar, Mukesh Kumar Sharma, Vinod Kumar

The fundamental concepts, safety guarantees, efficiency, and applicability to real-world cryptographic applications of both classical and quantum secret sharing techniques are carefully discussed in this work. Shamir’s and Blakley’s schemes are examples of CSS schemes that for long have provided information-theoretic security for sharing secrets among multiple parties such that only authorized subsets are able to retrieve the secret. However, in the post-quantum era, these systems inherently have a vulnerability to quantum computational attacks due to the fact that they rely exclusively on classical communication. This paper assesses trade-offs between classical efficiency and quantum-level security by closely examining their methodologies, security models, and resource requirements. Furthermore, it discusses practical issues, such as decoherence, quantum memory constraints, and channel authentication, that present significant challenges in the implementation of QSS. By making a comparison between these two paradigms, we identify the contexts in which each approach is particularly suitable, and thus point to possible hybrid frameworks combining the robustness of classical cryptography with quantum security. These comparisons provide new insights for designing next-generation cryptographic protocols in emerging quantum technologies.

Defence Science Journal•Oct 27, 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
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.
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.
With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties so that certain subsets can reconstruct the secret, while unauthorized subsets obtain no information. While QSS was introduced over twenty years ago, previous works focused only on existence of perfectly secure schemes, and the share size of the known schemes is exponential even for access structures computed by polynomial size monotone circuits. This stands in contrast to the classical case, where efficient computationally-secure schemes have been long known for all access structures in monotone P\mathsf{monotone~P}monotone P, and one can even obtain shares which are much shorter than the secret which is impossible with perfect security. In this work, we initiate the study of computationally-secure QSS and show that computational assumptions help significantly in building QSS schemes. We present a simple compiler and use it to obtain a large variety results: We construct polynomial-time QSS schemes under standard assumptions for a rich class of access structures. This includes many access structures for which previous results in QSS required exponential share size. We also construct QSS schemes for which the size of the shares is significantly smaller than the size of the secret. As in the classical case, this is impossible with perfect security. We also use our compiler to obtain results beyond computational QSS. In the information-theoretic setting, we improve the share size of perfect QSS schemes for a large class of access structures to 1.5n+o(n)1.5^{n+o(n)}1.5n+o(n), improving upon best known schemes and matching the best known result for general access structures in the classical case. Finally, we show construct efficient schemes for all access structures in P\mathsf{P}P and NP\mathsf{NP}NP when the quantum secret sharing scheme is given multiple of copies of the secret.
Abstract With the rapid development of quantum computing, traditional encryption methods face growing security threats. Quantum Secret Sharing (QSS) has emerged as a promising solution, using quantum principles to improve communication security and prevent internal and external attacks. This study proposes a new (t, n) Threshold Quantum Secret Sharing (TQSS) protocol based on single-qubit unitary operations and Lagrange interpolation. The protocol allows secret reconstruction without third-party or dealer assistance and remains efficient even when some participants are absent. To address more complex real-world scenarios, we extend our previously proposed (t, n) TQSS protocol into a Conditional Dynamic TQSS (CDTQSS). This approach uses resource-based share splitting to allow new participants to join without requiring the dealer to redistribute information. However, the protocol is ‘conditional’ because existing participants must take on extra responsibility-they must assist in generating shares for new members and also participate in the secret reconstruction process together with them. The protocol maintains strong security, reduces resource consumption, and offers better flexibility, making it well-suited for practical and dynamic quantum communication needs.
The fundamental concepts, safety guarantees, efficiency, and applicability to real-world cryptographic applications of both classical and quantum secret sharing techniques are carefully discussed in this work. Shamir’s and Blakley’s schemes are examples of CSS schemes that for long have provided information-theoretic security for sharing secrets among multiple parties such that only authorized subsets are able to retrieve the secret. However, in the post-quantum era, these systems inherently have a vulnerability to quantum computational attacks due to the fact that they rely exclusively on classical communication. This paper assesses trade-offs between classical efficiency and quantum-level security by closely examining their methodologies, security models, and resource requirements. Furthermore, it discusses practical issues, such as decoherence, quantum memory constraints, and channel authentication, that present significant challenges in the implementation of QSS. By making a comparison between these two paradigms, we identify the contexts in which each approach is particularly suitable, and thus point to possible hybrid frameworks combining the robustness of classical cryptography with quantum security. These comparisons provide new insights for designing next-generation cryptographic protocols in emerging quantum technologies.
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.