Course contentsShow
← Security
Lesson 322 of 3,0527. Randomness and Key ManagementFree lesson

Shamir's Secret Sharing Scheme

Understanding polynomial-based (t,n)-threshold schemes where t shares reconstruct the secret from n total.

Shamir's Secret Sharing Scheme

What You'll Learn

You'll learn how Shamir's Secret Sharing uses polynomials to split a secret into shares where any threshold number can reconstruct it, but fewer shares reveal nothing.


The Core Idea

Shamir's Secret Sharing is a (t,n)-threshold scheme that splits a secret into n pieces (shares) such that:

  • Any t shares can perfectly reconstruct the original secret
  • Any t-1 or fewer shares reveal absolutely nothing about the secret

This is the most widely-used secret sharing approach, invented by Adi Shamir in 1979.

How It Works (Plain English)

The secret becomes the constant term of a random polynomial of degree t-1. For example, if you need 3 shares to reconstruct (t=3), you create a degree-2 polynomial:

f(x) = secret + a₁x + a₂x²

The coefficients a₁ and a₂ are chosen randomly. You then evaluate this polynomial at n different points (x=1, x=2, ... x=n) to create n shares. Each share is a coordinate pair: (x, f(x)).

Why it works: A polynomial of degree t-1 is uniquely defined by any t points. With t shares, you can use polynomial interpolation (like Lagrange interpolation) to reconstruct the original polynomial and recover the secret. With only t-1 shares, infinitely many polynomials are possible—you learn nothing.

Simple Analogy

Think of it like a treasure map torn into pieces. You need at least 3 pieces to triangulate the treasure's location. With only 2 pieces, you have infinite possible locations—the secret remains perfectly hidden.


Key Takeaway: Shamir's Secret Sharing uses polynomial mathematics to create a (t,n)-threshold scheme where any t shares reconstruct the secret through interpolation, while fewer than t shares provide zero information.