Explore a cryptographic lecture on proving knowledge of small secrets, presented at Crypto 2016 by Carsten Baum, Ivan Damgård, Kasper Green Larsen, and Michael Nielsen. Delve into the importance of proving short secret lengths, homomorphic one-way functions, and Sigma Protocols. Examine the soundness lag proof, intuition behind the concept, and invariants. Gain insights into potential overhead and caveats associated with this cryptographic technique. Enhance your understanding of advanced cryptography concepts through this comprehensive presentation.
Overview
Syllabus
Introduction
Recap
Why would you like to prove that a secret is short
Homomorphic oneway functions
Sigma Protocols
Soundness Lag
Proof
Intuition
Invariant
Overhead
Caveat
Conclusion
Taught by
TheIACR
