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

Quantum Secret Sharing with Classical and Quantum Shares

Hua Sun

Published Jul 23, 2025• 1 citation
arXivHTMLPDF

Abstract

In quantum secret sharing, a quantum secret state is mapped to multiple shares such that shares from qualified sets can recover the secret state and shares from other forbidden sets reveal nothing about the secret state; we study the setting where there are both classical shares and quantum shares. We show that the quantum secret sharing problem with both classical and quantum shares is feasible if and only if any two qualified sets have some quantum share in common. Next, for threshold quantum secret sharing where there are $N_1$ classical shares, $N_2$ quantum shares and qualified sets consist of any $K_1$ (or more) classical shares and any $K_2 > N_2/2$ (or more) quantum shares, we show that to share $1$ qubit secret, each classical share needs to be at least $2$ bits and each quantum share needs to be at least $1$ qubit. Finally, we characterize the minimum share sizes for quantum secret sharing with at most $2$ classical shares and at most $2$ quantum shares. The converse proofs rely on quantum information inequalities and the achievable schemes use classical secret sharing, (encrypted) quantum secret sharing with only quantum shares, superdense coding, treating quantum digits as classical digits, and their various combinations.

DOI
10.48550/arxiv.2507.17364

Related papers

Secret Sharing of a Quantum State

He Lu, Zhen Zhang, Luo-Kan Chen +7 more

Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share certain amount of quantum information with a few players, has wide applications in quantum information.The critical criterion in a threshold secret sharing scheme is confidentiality; with less than the designated number of players, no information can be recovered.Furthermore, in a quantum scenario, one additional critical criterion exists; the capability of sharing entangled and unknown quantum information.Here by employing a six-photon entangled state, we demonstrate a quantum threshold scheme, where the shared quantum secrecy can be efficiently reconstructed with a state fidelity as high as 93%.By observing that any one or two parties cannot recover the secrecy, we show that our scheme meets the confidentiality criterion.Meanwhile, we also demonstrate that entangled quantum information can be shared and recovered via our setting, which demonstrates that our implemented scheme is fully quantum.Moreover, our experimental setup can be treated as a decoding circuit of the 5-qubit quantum error-correcting code with two erasure errors.

Conference on Lasers and Electro-Optics•Jan 1, 2017•3 citations

Advance Sharing of Quantum Shares for Quantum Secrets

Mamoru Shibata, Ryutaroh Matsumoto

Secret sharing is a cryptographic scheme to encode a secret to multiple shares being distributed to participants, so that only qualified sets of participants can restore the original secret from their shares. When we encode a secret by a secret sharing scheme and distribute shares, sometimes not all participants are accessible, and it is desirable to distribute shares to those participants before a secret information is determined. Secret sharing schemes for classical secrets have been known to be able to distribute some shares before a given secret. Lie et al. found a ((2, 3))-threshold secret sharing for quantum secrets can distribute some shares before a given secret. However, it is unknown whether distributing some shares before a given secret is possible with other access structures of secret sharing for quantum secrets. We propose a quantum secret sharing scheme for quantum secrets that can distribute some shares before a given secret with other access structures.

arXiv:2302.14448•IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Nov 23, 2023•6 citations

Secret Sharing of a Quantum State

He Lu, Zhen Zhang, Luo-Kan Chen +7 more

Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share a certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold secret sharing scheme is confidentiality: with less than the designated number of players, no information can be recovered. Furthermore, in a quantum scenario, one additional critical criterion exists: the capability of sharing entangled and unknown quantum information. Here, by employing a six-photon entangled state, we demonstrate a quantum threshold scheme, where the shared quantum secrecy can be efficiently reconstructed with a state fidelity as high as 93%. By observing that any one or two parties cannot recover the secrecy, we show that our scheme meets the confidentiality criterion. Meanwhile, we also demonstrate that entangled quantum information can be shared and recovered via our setting, which shows that our implemented scheme is fully quantum. Moreover, our experimental setup can be treated as a decoding circuit of the five-qubit quantum error-correcting code with two erasure errors.

arXiv:1604.08093•Physical Review Letters•Jul 13, 2016•105 citations

Computing on quantum shared secrets

Yingkai Ouyang, Si-Hui Tan, Liming Zhao +1 more

A ($k,n$)-threshold secret-sharing scheme allows for a string to be split into $n$ shares in such a way that any subset of at least $k$ shares suffices to recover the secret string, but such that any subset of at most $k\ensuremath{-}1$ shares contains no information about the secret. Quantum secret-sharing schemes extend this idea to the sharing of quantum states. Here we propose a method of performing computation securely on quantum shared secrets. We introduce a ($n,n$)-quantum secret sharing scheme together with a set of algorithms that allow quantum circuits to be evaluated securely on the shared secret without the need to decode the secret. We consider a multipartite setting, with each participant holding a share of the secret. We show that if there exists at least one honest participant, no group of dishonest participants can recover any information about the shared secret, independent of their deviations from the algorithm.

arXiv:1702.03689•Physical Review A•Nov 27, 2017•19 citations

Theory of quantum secret sharing

Daniel Gottesman

I present a variety of results on the theory of quantum secret sharing. I show that any mixed state quantum secret sharing scheme can be derived by discarding a share from a pure state scheme, and that the size of each share in a quantum secret sharing scheme must be at least as large as the size of the secret. I show that the only constraints on the existence of quantum secret sharing schemes with general access structures are monotonicity (if a set is authorized, so are larger sets) and the no-cloning theorem. I also discuss some aspects of sharing classical secrets using quantum states. In this situation, the size of each share can sometimes be half the size of the classical secret.

arXiv:quant-ph/9910067•Physical Review A•Mar 16, 2000•640 citations

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
In quantum secret sharing, a quantum secret state is mapped to multiple shares such that shares from qualified sets can recover the secret state and shares from other forbidden sets reveal nothing about the secret state; we study the setting where there are both classical shares and quantum shares. We show that the quantum secret sharing problem with both classical and quantum shares is feasible if and only if any two qualified sets have some quantum share in common. Next, for threshold quantum secret sharing where there are N1N_1N1​ classical shares, N2N_2N2​ quantum shares and qualified sets consist of any K1K_1K1​ (or more) classical shares and any K2>N2/2K_2 > N_2/2K2​>N2​/2 (or more) quantum shares, we show that to share 111 qubit secret, each classical share needs to be at least 222 bits and each quantum share needs to be at least 111 qubit. Finally, we characterize the minimum share sizes for quantum secret sharing with at most 222 classical shares and at most 222 quantum shares. The converse proofs rely on quantum information inequalities and the achievable schemes use classical secret sharing, (encrypted) quantum secret sharing with only quantum shares, superdense coding, treating quantum digits as classical digits, and their various combinations.
Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share certain amount of quantum information with a few players, has wide applications in quantum information.The critical criterion in a threshold secret sharing scheme is confidentiality; with less than the designated number of players, no information can be recovered.Furthermore, in a quantum scenario, one additional critical criterion exists; the capability of sharing entangled and unknown quantum information.Here by employing a six-photon entangled state, we demonstrate a quantum threshold scheme, where the shared quantum secrecy can be efficiently reconstructed with a state fidelity as high as 93%.By observing that any one or two parties cannot recover the secrecy, we show that our scheme meets the confidentiality criterion.Meanwhile, we also demonstrate that entangled quantum information can be shared and recovered via our setting, which demonstrates that our implemented scheme is fully quantum.Moreover, our experimental setup can be treated as a decoding circuit of the 5-qubit quantum error-correcting code with two erasure errors.
Secret sharing is a cryptographic scheme to encode a secret to multiple shares being distributed to participants, so that only qualified sets of participants can restore the original secret from their shares. When we encode a secret by a secret sharing scheme and distribute shares, sometimes not all participants are accessible, and it is desirable to distribute shares to those participants before a secret information is determined. Secret sharing schemes for classical secrets have been known to be able to distribute some shares before a given secret. Lie et al. found a ((2, 3))-threshold secret sharing for quantum secrets can distribute some shares before a given secret. However, it is unknown whether distributing some shares before a given secret is possible with other access structures of secret sharing for quantum secrets. We propose a quantum secret sharing scheme for quantum secrets that can distribute some shares before a given secret with other access structures.
Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share a certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold secret sharing scheme is confidentiality: with less than the designated number of players, no information can be recovered. Furthermore, in a quantum scenario, one additional critical criterion exists: the capability of sharing entangled and unknown quantum information. Here, by employing a six-photon entangled state, we demonstrate a quantum threshold scheme, where the shared quantum secrecy can be efficiently reconstructed with a state fidelity as high as 93%. By observing that any one or two parties cannot recover the secrecy, we show that our scheme meets the confidentiality criterion. Meanwhile, we also demonstrate that entangled quantum information can be shared and recovered via our setting, which shows that our implemented scheme is fully quantum. Moreover, our experimental setup can be treated as a decoding circuit of the five-qubit quantum error-correcting code with two erasure errors.
A (k,nk,nk,n)-threshold secret-sharing scheme allows for a string to be split into nnn shares in such a way that any subset of at least kkk shares suffices to recover the secret string, but such that any subset of at most $k\ensuremath{-}1$ shares contains no information about the secret. Quantum secret-sharing schemes extend this idea to the sharing of quantum states. Here we propose a method of performing computation securely on quantum shared secrets. We introduce a (n,nn,nn,n)-quantum secret sharing scheme together with a set of algorithms that allow quantum circuits to be evaluated securely on the shared secret without the need to decode the secret. We consider a multipartite setting, with each participant holding a share of the secret. We show that if there exists at least one honest participant, no group of dishonest participants can recover any information about the shared secret, independent of their deviations from the algorithm.
I present a variety of results on the theory of quantum secret sharing. I show that any mixed state quantum secret sharing scheme can be derived by discarding a share from a pure state scheme, and that the size of each share in a quantum secret sharing scheme must be at least as large as the size of the secret. I show that the only constraints on the existence of quantum secret sharing schemes with general access structures are monotonicity (if a set is authorized, so are larger sets) and the no-cloning theorem. I also discuss some aspects of sharing classical secrets using quantum states. In this situation, the size of each share can sometimes be half the size of the classical secret.
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.