Using Extensions of Min-Entropy to Help with Key Agreement and Leakage Resilience

Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=JvlYvKlri7E



Category:
Let's Play
Duration: 1:00:53
252 views
2


There are many different notions of information-theoretic entropy and its computational analogues. The right notion and a toolbox of lemmas can make for beautifully simple proofs. Drawing on examples from information-theoretic key agreement and leakage-resilient cryptography (no background in either is assumed), I will show how various extensions of min-entropy can help analyze cryptographic constructions. I will also present some (not always well-formed) open problems.







Tags:
microsoft research