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
nplayers 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
tplayers, out of the entire set on
nplayers, 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) 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.
We demonstrate a multipartite protocol that utilizes entanglement to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players. By collaborating together, a majority of the players can reconstruct the state, whilst the remaining player obtains nothing. This (2,3) threshold quantum state sharing scheme is characterized in terms of fidelity (F), signal transfer (T) and reconstruction noise (V). We demonstrate a fidelity averaged over all reconstruction permutations of 0.73 ± 0.04, a level achievable only using quantum resources.
Superconducting microwave quantum networks is a rapidly developing field, enabling distributed quantum computing and holding a promise for hybrid architectures in quantum internet. Quantum secret sharing (QSS) is one of the key protocols for multipartite quantum networks and can provide an unconditionally secure way to share quantum states among
n players. Using microwave two-mode squeezed states as an entanglement resource, we experimentally implement a QSS protocol with
n=3, where a subset of at least
k=2 players must collaborate to faithfully reconstruct the original secret state. We demonstrate reconstructed-state fidelities that surpass the asymptotic no-cloning threshold of
Fnc=2/3 and identify a parameter regime that allows for unconditionally secure communication in the presence of an omnipotent dishonest player. Furthermore, we experimentally explore inherent connections between QSS and other important quantum information processing tasks, such as quantum dense coding and elementary quantum error correction of channel erasures. Finally, we discuss extensions of QSS and its relation to the concept of blind quantum computing.
We demonstrate a multipartite protocol to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players. By collaborating, any two of the three players can reconstruct the state, while individual players obtain nothing. We characterize this (2,3) threshold quantum state sharing scheme in terms of fidelity, signal transfer, and reconstruction noise. We demonstrate a fidelity averaged over all reconstruction permutations of 0.73+/-0.04, a level achievable only using quantum resources.
Quantum-state sharing is a protocol where perfect reconstruction of quantum states is achieved with incomplete or partial information in a multipartite quantum network. Quantum-state sharing allows for secure communication in a quantum network where partial information is lost or acquired by malicious parties. This protocol utilizes entanglement for the secret-state distribution and a class of ``quantum disentangling'' protocols for the state reconstruction. We demonstrate a quantum-state sharing protocol in which a tripartite entangled state is used to encode and distribute a secret state to three players. Any two of these players can collaborate to reconstruct the secret state, while individual players obtain no information. We investigate a number of quantum disentangling processes and experimentally demonstrate quantum-state reconstruction using two of these protocols. We experimentally measure a fidelity, averaged over all reconstruction permutations, of $\mathcal{F}=0.73\ifmmode\pm\else\textpm\fi{}0.02$. A result achievable only by using quantum resources.