Computer Science/Discrete Mathematics Seminar I

In this talk, I will explore the fascinating landscape of assumptions in quantum cryptography—especially, how little we need to assume to build secure quantum protocols. We will cover key cryptographic primitives including quantum encryption, signatures, and money, and show how these primitives imply the existence of one-way puzzles, a quantum analogue of classical one-way functions. I will also highlight the utility of one-way puzzles and discuss concrete assumptions that enable their realization, revealing intriguing connections to quantum advantage.

No prior quantum background will be assumed. This talk is based on joint works with Kabir Tomer.