Date:
Tuesday, 3 December, 2024 - 14:00 to 15:00
Speaker:
Andrea Coladangelo (University of Washington)
Venue:
Computer Laboratory, William Gates Building, Room SS03
The topic of this talk fits into the broad direction of leveraging quantum information to realize cryptographic functionalities that are impossible to realize classically. I will describe an example of how quantum information can provide a form of protection against coercion (for example, in online elections) that is unattainable classically. More concretely, I will introduce a quantum extension of the notion of “deniable encryption”, which is well studied classically, and I will describe a construction satisfying the new notion based on the hardness of the learning with errors problem (LWE).
This is based on joint work with Shafi Goldwasser and Umesh Vazirani.
Seminar series:
Quantum Computing Seminar
