Cryptographic Hardness in a Quantum World
Dakshita Khurana
Abstract:
A flurry of exciting recent work has shown that the mathematical assumptions required to realize cryptosystems (beyond QKD) in a quantum world can be significantly weaker than their classical counterparts. This talk will discuss recent progress and some remaining challenges in understanding the assumptions that enable cryptography in a quantum world. The talk will not assume prior background in quantum information.
Based on joint works with Kabir Tomer.
Bio:
Dakshita Khurana is an Assistant Professor of Computer Science at the University of Illinois, Urbana-Champaign. Her research focuses on cryptography and its interactions with quantum information. Dakshita is a recipient of the NSF CAREER award, Google Research Scholar award, Visa Research faculty award, and a Graduate of Last Decade (GOLD) Alumni award from IIT-Delhi. In addition, her work has been funded through grants and gifts from the NSF, AFOSR, DARPA, C3AI and Jump Arches. She was named to Forbes List of 30 under 30 in Science and awarded a Google Research Fellowship at the Simons Institute, Berkeley.