Verifiable Secret Sharing & DKG

Splitting a Secret So No One Holds It

Secret sharing is a cryptographic technique for splitting a secret (like a private key or a password) into several pieces, called shares, and handing them to different parties — so that the secret can only be reconstructed if a required number of them (a threshold) combine their shares. For example, you might split a key into 5 shares such that any 3 can rebuild it, but any 2 or fewer learn nothing at all. The most famous scheme, Shamir's Secret Sharing, has this elegant property: below the threshold you get zero information about the secret, and at or above it you can reconstruct exactly. This removes single points of failure — no one party holds the whole secret, and losing some shares doesn't lose the secret.

The Problem: Can You Trust the Shares?

Basic secret sharing has a gap: how do the parties know the shares they received are valid and consistent? A malicious dealer (the person handing out shares) could distribute bad shares that don't actually reconstruct the intended secret, or reconstruct to something wrong — and no one would know until they tried to combine them, possibly at a critical moment. Verifiable secret sharing (VSS) fixes this by adding proofs: each party can independently verify that their share is correct and that all shares are consistent with a single valid secret, without learning the secret itself. VSS turns 'trust the dealer distributed shares honestly' into 'each party can check their share is genuine', which matters enormously when the shares protect something valuable.

• Secret sharing splits a secret into shares; a threshold number can reconstruct it
• Below the threshold, shares reveal nothing (e.g. Shamir's Secret Sharing)
• Basic sharing trusts the dealer to hand out valid, consistent shares
• Verifiable secret sharing (VSS) lets each party prove their share is genuine