IT-WORKS: Information-Theoretic Security With One Reusable Key
Yevgeniy Dodis
Video
Abstract:
Information-theoretic (IT) security is the gold standard: it protects against unexpected cryptanalytic advances, quantum computers, AI-assisted attacks, and “store now, decrypt later” adversaries alike. Unfortunately, Shannon’s impossibility result seems to kill it: without computational assumptions, the shared secret key must be as long as all the data it protects.
In this talk, I will present a series of works that bypass Shannon’s bound and achieve IT — or at least “everlasting” — security using server-aided randomness: semi-trusted servers store a huge random string and help users derive one-time pads on demand. The technical heart is locally computable randomness derivation from a giant key: locally computable t-wise independent hashing (STOC 2026), doubly-affine extractors (ITC 2021), the HELP model of everlasting privacy (CiC 2025), and t-time local MACs (new). These works culminate in our most recent result, IT-WORKS, where everything is information-theoretic, and the users need just one short reusable key — in fact, a reusable one-time pad!
Bio:
Yevgeniy Dodis is a Professor of Computer Science at New York University and a Fellow of the International Association for Cryptologic Research (IACR). His research focuses on cryptography and network security, with contributions to secure messaging, random number generation, leakage-resilient cryptography, and information-theoretic cryptography. His work has had real-world impact on widely used security systems, and he is a recipient of the 2019 and 2021 IACR Test-of-Time Awards.
