← GlossarySecurity
What Is Shamir's Secret Sharing? Splitting a Backup Into Shares
Shamir's Secret Sharing is a cryptographic method that splits a secret into several shares such that any chosen threshold of them can reconstruct it, while fewer than the threshold reveal nothing about it.
Key takeaways
- A k-of-n scheme needs any k of n shares to recover the secret.
- Fewer than k shares give no information about the secret.
- It tolerates losing some shares without losing the backup.
- It does not stop someone who gathers enough shares, and it adds handling complexity.
The idea
Adi Shamir's 1979 scheme answers a simple question: how can you split a secret among several people so that some subset can recover it but a smaller group cannot? The answer uses polynomials. A secret is encoded as a point on a curve, and shares are other points on it. With enough points you can reconstruct the curve and read the secret; with too few, every possible secret is equally likely.
Threshold schemes
The parameters are written k-of-n. You create n shares and require any k to recover. A 3-of-5 setup lets you lose two shares and still recover, while an attacker who steals two learns nothing. Because the guarantee is information-theoretic, it does not depend on computing power: no amount of computation helps with fewer than k shares.
Use for crypto backups
People use it to split a recovery secret so that no single hiding place is a single point of failure. One share could be in a safe, another with a relative and a third in a bank box. If one is lost or destroyed, the others can still rebuild the secret, and if one is stolen, the thief cannot use it.
Limits and care
Shamir sharing is not the same as a multisig wallet. Once you combine the shares to restore, the full secret is exposed at that moment on whatever device does the recovery, whereas multisig keeps keys separate when signing. You must also record the scheme's parameters and which wallet's format the shares use, because shares from different tools are not interchangeable. Test recovery with a small amount before relying on it.
Example
A recovery secret is split into 5 shares with a threshold of 3. Shares 1, 2 and 4 together recover it. Shares 1 and 2 alone reveal nothing, and losing shares 3 and 5 does not matter.
Put it into practice
Spread risk without adding confusion
Whatever backup scheme you choose, keep it simple enough to restore under stress. Scrypt Wallet recovers per coin from keys you back up, so write down which key goes with which coin.
Create a free wallet Get Scrypt for AndroidSources and verification
Last reviewed 2026-10-02 by the Scrypt Wallet team. The factual claims on this page, and where each comes from:
- Shamir's Secret Sharing splits a secret into parts so that a threshold number of parts is needed to reconstruct it. [1]
- With fewer than the threshold number of shares, no information about the secret is revealed. [1]
- The scheme was formulated by Adi Shamir in 1979. [1]
Sources
- Shamir's secret sharing · Wikipedia · secondary source
Primary sources are protocol papers, specifications, source code or a project's own documentation; secondary sources are wikis and explainers. We checked each claim against the source text on the review date. Found an error? Tell us and we will correct it.
Frequently asked questions
Is it the same as multisig?
No. Multisig requires several keys to sign a transaction. Secret sharing splits one secret and rebuilds it for recovery.
Does every wallet support it?
No. Support and formats vary, so check how your wallet implements sharing.
Is it safer than one backup?
It reduces the risk of a single point of failure but adds complexity, which can itself cause loss.
Written by the Scrypt Wallet team · Updated 2026-10-02. General education, not financial, tax or legal advice.