- Shamir’s Secret Sharing splits a secret so any chosen number of holders can reconstruct it, but fewer reveal absolutely nothing.
- Adi Shamir — the S in RSA — published this elegant scheme in 1979, and it still underpins modern cryptographic recovery systems today.
- The math relies on polynomial interpolation: two points define a line, three define a parabola, and the secret hides at the origin.
- Photo storage company Ente uses Shamir’s Secret Sharing inside its Legacy Kit to enable revocable, server-mediated account recovery.
- Shamir’s Secret Sharing splits a secret so any chosen number of holders can reconstruct it, but fewer reveal absolutely nothing.
- Adi Shamir — the S in RSA — published this elegant scheme in 1979, and it still underpins modern cryptographic recovery systems today.
- The math relies on polynomial interpolation: two points define a line, three define a parabola, and the secret hides at the origin.
- Photo storage company Ente uses Shamir’s Secret Sharing inside its Legacy Kit to enable revocable, server-mediated account recovery.
A 1979 Idea That Cryptography Still Can’t Improve On
Shamir’s Secret Sharing is one of those rare cryptographic ideas that arrived nearly fully formed. Adi Shamir — you know him as the S in RSA, one of the most consequential trios in the history of computer science — published the scheme in 1979, and the core concept hasn’t needed to change since. Split a secret into n pieces. Require any k of them to reconstruct it. Anyone holding fewer than k pieces learns absolutely nothing. Not
Source: https://ente.com/blog/how-shamirs-secret-sharing-works/
