Computer Science/Discrete Mathematics Seminar I
Quantum Cryptography for the AI Age
Quantum computers will pose a major threat to the cryptography we use today. But quantum physics also lets us do things that are impossible classically. With quantum key distribution, for example, two people can share a secret key without a computational hardness assumption. We can even have digital tokens that can’t be copied, such as quantum money and one-shot signatures.
In this talk I’ll highlight two examples of “quantum-powered cryptography” and speculate about what they might have to do with AI safety and alignment. First, there’s a whole world of quantum cryptographic primitives that rely on fewer mathematical assumptions than we need classically. Given the recent spate of AI cryptanalysis results, there's urgency in finding cryptosystems that rely on as few assumptions as possible.
Second, I will talk about interactive proofs of physical location. Trustworthy proofs of location are not possible in a classical world, but are possible in a quantum world via *quantum position verification* protocols. I will discuss how such protocols may be helpful for problems in AI alignment (e.g., holding AI agents liable for their actions).