Dakshita Khurana

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

I work in Cryptography and the foundations of Security, and more broadly in Theoretical Computer Science. My primary interests lie in the
foundations of non-malleable cryptography, zero-knowledge and multi-party computation.

Before joining UIUC, I was a Postdoctoral Researcher at Microsoft Research New England, working primarily with Yael Kalai.
Before that, I obtained my PhD from UCLA under the fantastic supervision of Amit Sahai and Rafail Ostrovsky. You can find my CV here.

I am looking for motivated students and postdocs. Interested students should apply here.
Also, here is an exciting opportunity for postdocs. Please send me an email if you are interested in working with me!

TEACHING
Fall 2019 : Special Topics in Cryptography (CS598DK)
Fall 2020: Applied Cryptography (CS498AM & ECE498AC), upcoming, online

PROGRAM COMMITTEES
Eurocrypt 2019, ITCS 2020, STOC 2020, TCC 2020

PUBLICATIONS

1. Statistical ZAP Arguments
   Eurocrypt 2020
2. Computational Extractors with Negligible Error in the CRS Model
   Eurocrypt 2020
3. Non-interactive non-malleability from Quantum Supremacy
   CRYPTO 2019
4. Weak Zero-Knowledge Beyond the Black-Box Barrier
   STOC 2019, Invited to the SICOMP Special Issue for STOC 2019
5. Non-interactive Delegation for Low Space Non-Deterministic Computation
   STOC 2018
6. Statistical WI (and More) in Two Messages
   Eurocrypt 2018
7. Promise Zero Knowledge and Applications to Round Optimal MPC
   CRYPTO 2018
8. Round Optimal Black-Box ``Commit-and-Prove''
   TCC 2018
9. Upgrading to Functional Encryption
   TCC 2018 
10. How to Achieve Non-Malleability in One or Two Rounds
    FOCS 2017, Invited to the SICOMP Special Issue for FOCS 2017
11. Distinguisher-Dependent Simulation in 2 Rounds and Applications
    CRYPTO 2017
12. New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs
    Eurocrypt 2017
13. Round Optimal Concurrent Non-Malleability from Polynomial Hardness
    TCC 2017
14. Round Optimal Concurrent MPC via Strong Simulation
    TCC 2017 
15. Breaking the 3 Round Barrier for Non-Malleable Commitments
    FOCS 2016
16. All Complete Functionalities are Reversible
    EUROCRYPT 2016
17. Secure Computation from Elastic Noisy Channels
    EUROCRYPT 2016
18. How to Generate and Use Universal Samplers
    ASIACRYPT 2016
19. Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
    ICALP 2016 (Track A)
20. Multi-Party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
    ASIACRYPT 2015
21. Statistical Randomized Encodings: A Complexity Theoretic View
    ICALP 2015 (Track A) 
22. Non-Malleable Multi-Prover Interactive Proofs and Witness Signatures
    Cryptology ePrint Archive 2015
23. Black-Box Separations for Differentially Private Protocols
    ASIACRYPT 2014