Information-Theoretic Cryptography: Partial Secrecy Problem

This lecture covers the Partial Secrecy Problem in Information-Theoretic Cryptography, focusing on topics such as secret communication, computational security, randomness extraction, and secret key capacity. It discusses the concept of partial secrecy, defining leakage measures between different sources, and explores examples like mutual information and information leakage. The lecture also delves into differential privacy, maximal leakage, and secrecy by design, highlighting motivations, advantages, and disadvantages of each concept.