Multi-Party Quantum Secret Sharing and State Reconstruction

17 concepts9 papers1 proposal

Standard quantum cryptography, such as Quantum Key Distribution (QKD), is fundamentally a two-party game. Alice wants to send a secure message to Bob, and they use the laws of quantum mechanics to ensure no external eavesdropper (Eve) can intercept it.

However, real-world collaborative environments often require group-wide secrets. Imagine a scenario where a launch code or a highly sensitive quantum state must be protected so that no single individual—nor any unauthorized faction—can access it alone. To unlock the secret, a qualified coalition of participants must actively cooperate.

This is the domain of Quantum Secret Sharing (QSS) and Multi-Party Quantum State Sharing. The core challenge of this research direction is moving from two-party security to multi-party environments, where the primary threat is often not an external spy, but a dishonest insider.

The Core Mechanism: Hiding Information in Global Correlations

To understand why quantum secret sharing works, we must first look at how quantum information can be perfectly concealed. In a foundational paper on quantum encryption, P. Oscar Boykin demonstrated in Optimal encryption of quantum bits that perfectly hiding $n$ qubits requires exactly $2n$ random classical bits—a framework known as the Quantum One-Time Pad. If an adversary lacks these classical bits, the encrypted quantum state looks completely random (maximally mixed), yielding zero information.

QSS operationalizes this principle by splitting those crucial classical or quantum "keys" across multiple participants using multipartite entanglement.

       [ Secret State / Key ]
                 │
                 ▼
       ┌───────────────────┐
       │   Distributor     │
       └─┬───────┬───────┬─┘
         │       │       │  (Entangled Shares)
         ▼       ▼       ▼
      ┌───┐   ┌───┐   ┌───┐
      │ P1│   │ P2│   │ P3│  <-- Individual shares look completely random
      └───┘   └───┘   └───┘
         │       │       │
         └───────┼───────┘  (LOCC / Collaboration)
                 ▼
       [ Reconstructed State ]

Consider a protocol that utilizes highly entangled states, such as Greenberger-Horne-Zeilinger (GHZ) or cluster states. As shown by Fu‐Guo Deng et al. in Symmetric multiparty-controlled teleportation of an arbitrary two-particle entanglement, a secret state can be teleported to a destination agent only if all other agents perform local measurements and pool their classical outcomes.

Because the information is stored in the global correlations of the entangled state, the reduced density matrix held by any single participant or unauthorized subgroup contains absolutely no trace of the secret. As explored by Yang Xiang in Multipartite quantum cryptography based on the violation of Svetlichny’s inequality, these collective correlations can be verified simultaneously using non-locality tests. If an unauthorized subset attempts to decrypt the data independently, the mathematics of quantum mechanics guarantees they will see nothing but white noise.

The Enemy Within: Defeating Participant Attacks

In standard QKD, the participants are assumed to be honest, while the adversary is external. In multi-party secret sharing, this assumption breaks down. A legitimate member of the protocol might act maliciously, attempting to gather other participants' shares early or manipulate the final outcome. These are known as participant attacks.

As noted by Min Jiang et al. in Erratum to: An efficient scheme for multi-party quantum state sharing of an arbitrary multi-qubit state with one GHZ channel, a robust QSS scheme must ensure that dishonest internal participants cannot reconstruct the state prematurely or deceive their peers. For instance, a malicious participant might try to intercept quantum channels or exploit mathematical loopholes. However, as Cheng-An Yen et al. demonstrated in Comment on “A special attack on the multiparty quantum secret sharing of secure direct communication using single photons”, when protocols are properly designed around the strict orthogonality of quantum states, these specialized insider attacks fail to extract any actionable information.

To actively prevent insiders from manipulating the protocol, modern architectures incorporate verifiability. For example, Li-Juan Liu proposed a multi-party quantum key agreement protocol in A verifiable quantum key agreement protocol based on six-qubit cluster states that forces participants to perform local unitary operations based on their private secrets. By combining this physical partitioning with classical homomorphic hash functions, the protocol ensures that every participant's contribution is locked in simultaneously. No single participant can alter their input or steal the key early without instantly failing the verification check.

Doubling the Threshold via Approximate Reconstruction

There is an intimate mathematical link between quantum secret sharing and quantum error-correcting codes (QECC). If a share is held by a dishonest participant or lost entirely, it can be modeled as an error or an erasure at a specific position in the quantum code.

For a long time, quantum information theory operated under a strict "speed limit": no quantum code could perfectly correct more than $n/4$ arbitrary errors. If too many participants in a secret sharing scheme turned malicious, the secret was considered permanently compromised or unrecoverable.

Error Correction Thresholds (n = number of shares)

Perfect Reconstruction Limit:
[████████████░░░░░░░░░░░░░░░░░░░░] Max n/4 errors

Approximate Reconstruction Limit:
[█████████████████████████░░░░░░░] Max (n-1)/2 errors (Doubled!)

This limit was bypassed by Claude Crépeau et al. in Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. The authors realized that if we relax the requirement from perfect reconstruction to approximate reconstruction—allowing a negligible, statistically insignificant error in the recovered state—we can tolerate up to $(n-1)/2$ arbitrary errors. This effectively doubles the security threshold of the secret sharing scheme, allowing a secret to remain secure and reconstructible even when nearly half of the participants are compromised.

Scaling to Practical Networks

As the field matures, researchers are moving away from idealized laboratory setups toward scalable, real-world implementations. This transition takes two main paths:

  1. Continuous-Variable and Long-Distance Links: Instead of relying on fragile single photons (discrete variables), schemes like the one proposed by Chengji Liu et al. in Continuous-Variable Quantum Secret Sharing Based on Thermal Terahertz Sources in Inter-Satellite Wireless Links utilize continuous-variable architectures. By leveraging terahertz (THz) frequencies, these protocols aim to make multi-party secret sharing viable across long distances, such as inter-satellite wireless networks.
  2. Entanglement-Free Threshold Schemes: Generating and maintaining multi-particle entangled states across large networks is technologically demanding. To circumvent this, Changbin Lu et al. developed an alternative framework in A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security. This approach achieves a flexible $(t, n)$ threshold structure—where any $t$ out of $n$ participants can reconstruct the secret—without requiring pre-shared entanglement, while maintaining information-theoretic security against both external eavesdroppers and dishonest dealers.

By blending the foundational physics of non-locality with the mathematical flexibility of approximate error correction and classical verification, multi-party quantum secret sharing provides a secure blueprint for distributed trust in the quantum era.

Key Foundational Work

Symmetric multiparty-controlled teleportation of an arbitrary two-particle entanglement (2005) — contributed 1 concept elements to this direction.
Optimal encryption of quantum bits (2003) — contributed 1 concept elements to this direction.
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes (2005) — contributed 1 concept elements to this direction.
History & citationVersion 1 · 2026-10-04

Current · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_quantum_secret_sharing_c3515148,
  title = {quantum secret sharing},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/quantum-secret-sharing/rdr_c3515148832645a09b791048e3e7666f},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 1, frozen text):

@misc{lacuna_quantum_secret_sharing_c3515148_v1,
  title = {quantum secret sharing},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/quantum-secret-sharing/rdr_c3515148832645a09b791048e3e7666f/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake