Speaker Leo Reyzin
Host Melissa Chase
Affiliation Boston University
Date recorded 14 July 2011
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.
©2011 Microsoft Corporation. All rights reserved.