Dakshita Khurana

​Assistant Professor of Computer Science
University of Illinois Urbana-Champaign
​Office: 4308 Siebel Center

I work in cryptography, and more recently, on its intersection with quantum information. I am broadly interested in theoretical computer science. 

You will find an overview of my research on this page, and my CV here. 
​
I obtained my PhD from UCLA under the fantastic supervision of Amit Sahai and Rafail Ostrovsky.
I was then a postdoctoral researcher at Microsoft Research New England, working primarily with Yael Kalai. 

I am lucky to be able to work with a wonderful set of students! Please send me an email if you are interested in working with me.

TEACHING
Fall 2022 (upcoming): Cryptography (CS407)
Spring 2022: Quantum Cryptography (CS598 CTO)
Fall 2021: Algorithms and Models of Computation (CS374)
Spring 2021: Special Topics in Cryptography - Lattice-Based Cryptosystems (CS598DK)*
Fall 2020: Applied Cryptography (CS/ECE 498AC)
Fall 2019: Special Topics in Cryptography - Protocols (CS598DK)*
*On the list of Teachers Ranked as Excellent

PROGRAM COMMITTEES
ITCS 2023, TCC 2022, STOC 2022, ITCS 2020, STOC 2020, TCC 2020, Indocrypt 2020, Eurocrypt 2019.

RESEARCH: See here for an overview by area.

Selected Recent Work (Authors arranged alphabetically).

1. SNARGs for P from Sub-exponential DDH and QR
   ​with James Hulett, Ruta Jawale and Akshayaram Srinivasan. (EUROCRYPT 2022)
2. One-way Functions imply Secure Computation in a Quantum World
   with James Bartusek, Andrea Coladangelo and Fermi Ma. (CRYPTO 2021. Long Plenary Talk at QIP 2021, Invited Talk at QCrypt 2021, both joint with GLSV)
3. SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE
   with Ruta Jawale, Yael Kalai and Rachel Zhang. (STOC 2021)
4. Non-Interactive Distributional Indistinguishability and Non-Malleable Commitments
   Dakshita Khurana. (EUROCRYPT 2021)
5. Weak Zero-Knowledge Beyond the Black-Box Barrier
   with Nir Bitansky and Omer Paneth. (STOC 2019, SICOMP 2022 Special Issue for STOC 2019)
6. How to Achieve Non-Malleability in One or Two Rounds
   with Amit Sahai. (FOCS 2017, Invited to the SICOMP Special Issue for FOCS 2017)
7. Distinguisher-Dependent Simulation in 2 Rounds and Applications
   with Abhishek Jain, Yael Kalai and Ron Rothblum. (CRYPTO 2017)

All Publications (Authors arranged alphabetically).

1. Revisiting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC
   ​with James Hulett, Ruta Jawale and Akshayaram Srinivasan. (ITC 2022)
2. SNARGs for P from Sub-exponential DDH and QR
   with James Hulett, Ruta Jawale and Akshayaram Srinivasan. (EUROCRYPT 2022)
3. Round Optimal Black-Box Protocol Compilers
   with Yuval Ishai, Amit Sahai and Akshayaram Srinivasan. (EUROCRYPT 2022)
4. COA-Secure Obfuscation and Applications
   with Ran Canetti, Suvradip Chakraborty, Nishant Kumar, Oxana Poburinnaya and Manoj Prabhakaran. (EUROCRYPT 2022)
5. Weak Zero-Knowledge Beyond the Black-Box Barrier
   with Nir Bitansky and Omer Paneth. (STOC 2019, SICOMP Special Issue for STOC, 2022)
6. Two-Round Maliciously Secure Computation with Super-Polynomial Simulation
   with Amit Agarwal, James Bartusek, Vipul Goyal and Giulio Malavolta. (TCC 2021)
7. On the Round Complexity of Black-Box Secure MPC
   with Yuval Ishai, Akshayaram Srinivasan and Amit Sahai. (CRYPTO 2021)
8. One-way Functions imply Secure Computation in a Quantum World
   with James Bartusek, Andrea Coladangelo and Fermi Ma. (CRYPTO 2021. Long Plenary Talk at QIP 2021, Invited Talk at QCrypt 2021, both joint with GLSV)
9. On the Round Complexity of Secure Quantum Computation
   with James Bartusek, Andrea Coladangelo and Fermi Ma. (CRYPTO 2021, Contributed Talk at QIP 2021 and QCrypt 2021)​
10. Improved Computational Extractors and their Applications
    with Akshayaram Srinivasan. (CRYPTO 2021)
11. Compact Ring Signatures from Learning with Errors
    with Rohit Chatterjee, Sanjam Garg, Mohammad Hajiabadi, Xiao Liang, Giulio Malavolta, Omkant Pandey and Sina Shiehian. (CRYPTO 2021) 
12. SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE
    with Ruta Jawale, Yael Kalai and Rachel Zhang. (STOC 2021)
    Merge of [JK20] and [KZ20].
13. On the CCA Compatibility of Public-Key Infrastructure
    with Brent Waters. (PKC 2021)
14. Non-Interactive Distributional Indistinguishability and Non-Malleable Commitments
    Dakshita Khurana. (EUROCRYPT 2021)
15. Post-Quantum Multi-Party Computation
    with Amit Agarwal, James Bartusek, Vipul Goyal and Giulio Malavolta. (EUROCRYPT 2021) 
16. Black-box Non-Interactive Non-Malleable Commitments
    with Rachit Garg, George Lu and Brent Waters. (EUROCRYPT 2021) 
17. Computational Extractors with Negligible Error in the CRS Model
    with Ankit Garg and Yael Kalai. (EUROCRYPT 2020) 
18. Statistical ZAP Arguments
    with Saikrishna Badrinarayanan, Rex Fernando, Aayush Jain and Amit Sahai. (EUROCRYPT 2020)
19. On Statistical Security in Two Party Computation
    with Muhammad Haris Mughees. (TCC 2020)
20. Non-interactive non-malleability from Quantum Supremacy
    with Yael Kalai. (CRYPTO 2019)
21. Non-interactive Delegation for Low Space Non-Deterministic Computation
    with Saikrishna Badrinarayanan, Yael Kalai, Amit Sahai and Daniel Wichs. (STOC 2018)
22. Statistical WI (and More) in Two Messages
    with Yael Kalai and Amit Sahai. (EUROCRYPT 2018)
23. Promise Zero Knowledge and Applications to Round Optimal MPC
    with Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Yael Kalai and Amit Sahai. (CRYPTO 2018)
24. Round Optimal Black-Box ``Commit-and-Prove''
    with Rafail Ostrovsky and Akshayaram Srinivasan. (TCC 2018)
25. Upgrading to Functional Encryption
    with Saikrishna Badrinarayanan, Amit Sahai and Brent Waters. (TCC 2018) 
26. How to Achieve Non-Malleability in One or Two Rounds
    with Amit Sahai. (FOCS 2017, Invited to the SICOMP Special Issue for FOCS 2017)
27. Distinguisher-Dependent Simulation in 2 Rounds and Applications
    with Abhishek Jain, Yael Kalai and Ron Rothblum. (CRYPTO 2017)
28. New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs
    with Saikrishna Badrinarayanan, Rafail Ostrovsky and Ivan Visconti. (EUROCRYPT 2017)
29. Round Optimal Concurrent Non-Malleability from Polynomial Hardness
    Dakshita Khurana. (TCC 2017)
30. Round Optimal Concurrent MPC via Strong Simulation
    with Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain and Amit Sahai.  (TCC 2017)
    merged version of [BKS17] and [GJ17]
31. Breaking the 3 Round Barrier for Non-Malleable Commitments
    with Vipul Goyal and Amit Sahai. (FOCS 2016)
32. All Complete Functionalities are Reversible
    with Daniel Kraschewski, Hemanta Maji, Manoj Prabhakaran and Amit Sahai. (EUROCRYPT 2016)
33. Secure Computation from Elastic Noisy Channels
    with Hemanta Maji and Amit Sahai. (EUROCRYPT 2016)
34. How to Generate and Use Universal Samplers
    with Dennis Hofheinz, Tibor Jager, Amit Sahai, Brent Waters and Mark Zhandry. (ASIACRYPT 2016)
    merged version of [HJZ14] and [KSW14]
35. Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
    with Vipul Goyal, Ilya Mironov, Omkant Pandey and Amit Sahai. (ICALP 2016 - Track A)
36. Multi-Party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
    with Vanishree Rao and Amit Sahai. (ASIACRYPT 2015)
37. Statistical Randomized Encodings: A Complexity Theoretic View
    with Shweta Agarwal, Yuval Ishai and Anat Paskin-Cherniavsky. (ICALP 2015 - Track A) 
38. Non-Malleable Multi-Prover Interactive Proofs and Witness Signatures
    with Aayush Jain and Vipul Goyal. (Cryptology ePrint Archive 2015)
39. Black-Box Separations for Differentially Private Protocols
    with Hemanta Maji and Amit Sahai. (ASIACRYPT 2014) 

Navigation pane photograph taken at Milford Sound.
Background attribution: ​https://www.flickr.com/photos/chiaralily/7880154722