Replacing Probability Distributions in Security Games via Hellinger Distance

Explore a conference talk from the 2021 ITC Conference that delves into the concept of replacing probability distributions in security games using Hellinger distance. Learn about the bit security framework of Micciancio & Walter (2018), compare Max-Log and Hellinger approaches, and understand the Leftover Hash Lemma for Hellinger distance. Gain insights into statistical distance, also known as total variation distance, and its application in security games. Discover how this research, presented by Kenji Yasunaga, contributes to the field of cryptography and security. Follow the speaker's journey from introduction to conclusions, covering topics such as public-key encryption (PKE) security, proof overview, and related work in this 21-minute presentation from the Paul G. Allen School.

Intro
Security came for PKE
Statistical Distance (a.k.a. Total Variation Distance)
Replacing Distributions in Security Games
Bit security framework of Micciancio & Walter (2018)
Max-Log vs Hellinger
Leftover Hash Lemma for Hellinger distance
Proof Overview
Related Work
Conclusions