Protecting Your Secrets With Polynomials - Shamir's Secret Sharing
Audience: high-schoolundergraduate
Tags: number-theorycryptography
Suppose there are n colleagues who all wish to have access to a secret. Giving the full secret to each person is too risky - one untrustworthy colleague could leak its entire contents. Splitting the secret into n parts and giving each colleague a piece is too impractical, as it would require all n participants to combine their pieces to recover the secret. Can we divide the secret into n parts, such that only a certain number of colleagues, k, need to combine their parts to recover the secret? This video explains how this is possible with Shamir's Secret Sharing, devised by Adi Shamir in 1979.
Analytics
Comments
What a phenomenal video! Everything was perfectly clear, well-motivated, and super fun. I really don’t have any complaints. I am curious why we used polynomials instead of bumping up the dimension - could we instead use points on a -dimensional hyperplane in ? Amazing job!
Solid video with a good voice-over, presentation, and explanation behind the concept.
The scenario you gave at the beginning of the video did a very good job at explaining the problem and setting everything up.
The only thing I could really think I could have improved is maybe trying to find a way to very the voice-over a bit so that you can maintain energy and attention throughout the video.
Interested premise. I was hooked at the start but it maybe dragged on slightly long
Thanks for putting this out there! The example and characters kept the engagement up.
Very nice and clear. Maybe too long for students.
well done, it is very clear. Nevertheless : I think it can be greatly improved by re-recording the voice / comments. The tone is relatively monotonous, which does not help for continuous attention, and also which leads to miss some particularly important / tricky points. More variations in the tone, more emphasis on some specific topics could really improve the thing. Alos, technically, take care of the sound level, which is low (when adverts arrive, it’s painful)
The explanation is excellent, and the problem is well-motivated. You do a good job justifying that each tool is right for the job, but it’s not as clear where they come from. How would someone come up with the idea of a polynomial encoding in the first place?
Each step is well-motivated. So, the viewing is very smooth.