← Back to the reading view
Slides · 6 slides
Shamir's Secret Sharing
The same module told visually, ready to present. Speaker notes carry the full explanation.
In practice
Shamir's Secret Sharing
No single person holds the key, yet any k of n can rebuild it
A (k, n)-threshold scheme tolerates n − k lost or absent shares
Shamir's Secret Sharing · Classical Crypto Today1 / 6
The core idea
k points pin down a degree k − 1 polynomial
Shamir's Secret Sharing · Classical Crypto Today2 / 6
Worked example · mod 23
Split s = 13, k = 3, n = 5
Shamir's Secret Sharing · Classical Crypto Today3 / 6
Recovery
Lagrange interpolation at x = 0
Shamir's Secret Sharing · Classical Crypto Today4 / 6
Information-theoretic
Below the threshold, nothing leaks
Shamir's Secret Sharing · Classical Crypto Today5 / 6
In the field
Where threshold sharing shows up
Shamir's Secret Sharing · Classical Crypto Today6 / 6
1 / 6
Keys: ← → move, F full screen, G all slides, N notes