Skip to main content

​
Secret Sharing

A technique that divides a secret into multiple shares so a threshold of participants is required to reconstruct it.

​
Definition

A technique that divides a secret into multiple shares so a threshold of participants is required to reconstruct it.

​
Why it matters

Cryptography provides the mathematical foundation for keys, signatures, privacy, integrity, and verification.

​
How it works

The secret is encoded into a mathematical polynomial. Each participant is given a point on that polynomial. By gathering a specific number of points, the original polynomial can be reconstructed, thereby recovering the secret. If fewer than the threshold are collected, the secret remains mathematically impossible to determine.

​
Real-world example

Used in multi-party computation (MPC) wallets like Fireblocks or Gnosis Safe recovery processes.

​
Advantages

  • No single point of failure
  • Flexible threshold configurations
  • High fault tolerance

​
Limitations

  • High operational complexity
  • Coordination overhead
  • Share storage risks

​
Common misconceptions

  • People assume the individual shares reveal information about the secret, but they are actually mathematically independent.
  • Users often mistakenly think they need all shares to recover the secret.
Canonical knowledge ID: glossary:secret-sharing