[jacobkg]

What's especially cool about this technique is that unlike most crypto proofs it does not assume the existence of one-way functions (none have been found yet) nor does it require a computationally bounded adversary.

Instead this technique is information theoretically secure so even an adversary with the ability to perform exponentially slow algorithms instantly could not find the secret.

All this in a two page paper that only required high school math!

PS - The "Shamir" who found this technique is the S in RSA