Deniable encryption in a quantum world

Add to your list(s) Download to your calendar using vCal

• Andrea Coladangelo (University of Washington)
• Tuesday 03 December 2024, 14:00-15:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact Tom Gur.

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.

This talk is part of the Quantum Computing Seminar series.

This talk is included in these lists:

• Algorithms and Complexity Seminar
• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Quantum Computing Seminar
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ki287

Note that ex-directory lists are not shown.