Improving Cryptography by Studying Entropy

דובר:

Leonid Reyzin

תאריך:

יום שלישי, 8.11.2011, 14:30

מקום:

חדר 337-8 טאוב.

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, leakage-resilient cryptography, and deterministic encryption (no background in these topics is assumed), I will show how various extensions of entropy can lead to improved cryptographic constructions.