אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

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.