Cryptography with Certified Deletion
James Bartusek
Video
Abstract:
This talk will be about building quantum cryptosystems that support verifiable deletion of plaintext information. We will discuss a generic approach to designing and proving the security of such cryptosystems, with a focus on everlasting security. That is, we will show how information held by the adversary (in encrypted form) can be verifiably erased from its view, rendering it unrecoverable even given the secret key of the cryptosystem or unbounded computational power. No background in quantum information is assumed. The talk will primarily be based on a joint work with Dakshita Khurana (https://eprint.iacr.org/2022/1178.pdf), but I may also mention some ideas from follow-up joint works with Vipul Goyal, Dakshita Khurana, Giulio Malavolta, Alexander Poremba, Justin Raizes, Bhaskar Roberts, and Michael Walter.
Bio:
James Bartusek is a Ph.D. candidate at the University of California, Berkeley, where he is advised by Sanjam Garg. His research interests span cryptography and quantum computation, with a particular focus on their interplay.