Dakshita Khurana
|
|
I work in Cryptography and the foundations of Security, and more broadly in Theoretical Computer Science. My primary interests lie in the theoretical foundations of
protocol design: cryptographic proof systems, non-malleable cryptography 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! Please send me an email if you are interested in working with me.
protocol design: cryptographic proof systems, non-malleable cryptography 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! Please send me an email if you are interested in working with me.
|
TEACHING
Spring 2021 (NEW) : Special Topics in Cryptography (CS598DK) Fall 2020 : Applied Cryptography (CS/ECE 498AC) Fall 2019 : Special Topics in Cryptography (CS598DK) |
PROGRAM COMMITTEES
Eurocrypt 2019, ITCS 2020, Indocrypt 2020, STOC 2020, TCC 2020.
Eurocrypt 2019, ITCS 2020, Indocrypt 2020, STOC 2020, TCC 2020.
PUBLICATIONS (Authors arranged alphabetically).
- One-way Functions imply Secure Computation in a Quantum World
with James Bartusek, Andrea Coladangelo and Fermi Ma. (Plenary Talk at QIP 2021) - On the Round Complexity of Two-party Quantum Computation
with James Bartusek, Andrea Coladangelo and Fermi Ma. (Contributed Talk at QIP 2021) - 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]. - On the CCA Compatibility of Public-Key Infrastructure
with Brent Waters. (PKC 2021) - Non-Interactive Distributional Indistinguishability and Non-Malleable Commitments
Dakshita Khurana. (EUROCRYPT 2021) - Post-Quantum Multi-Party Computation
with Amit Agarwal, James Bartusek, Vipul Goyal and Giulio Malavolta. (EUROCRYPT 2021) - Black-box Non-Interactive Non-Malleable Commitments
with Rachit Garg, George Lu and Brent Waters. (EUROCRYPT 2021) - Computational Extractors with Negligible Error in the CRS Model
with Ankit Garg and Yael Kalai. (EUROCRYPT 2020) - Statistical ZAP Arguments
with Saikrishna Badrinarayanan, Rex Fernando, Aayush Jain and Amit Sahai. (EUROCRYPT 2020) - On Statistical Security in Two Party Computation
with Muhammad Haris Mughees. (TCC 2020) - Non-interactive non-malleability from Quantum Supremacy
with Yael Kalai. (CRYPTO 2019) - Weak Zero-Knowledge Beyond the Black-Box Barrier
with Nir Bitansky and Omer Paneth. (STOC 2019, Invited to the SICOMP Special Issue for STOC 2019) - Non-interactive Delegation for Low Space Non-Deterministic Computation
with Saikrishna Badrinarayanan, Yael Kalai, Amit Sahai and Daniel Wichs. (STOC 2018) - Statistical WI (and More) in Two Messages
with Yael Kalai and Amit Sahai. (EUROCRYPT 2018) - Promise Zero Knowledge and Applications to Round Optimal MPC
with Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Yael Kalai and Amit Sahai. (CRYPTO 2018) - Round Optimal Black-Box ``Commit-and-Prove''
with Rafail Ostrovsky and Akshayaram Srinivasan. (TCC 2018) - Upgrading to Functional Encryption
with Saikrishna Badrinarayanan, Amit Sahai and Brent Waters. (TCC 2018) - How to Achieve Non-Malleability in One or Two Rounds
with Amit Sahai. (FOCS 2017, Invited to the SICOMP Special Issue for FOCS 2017) - Distinguisher-Dependent Simulation in 2 Rounds and Applications
with Abhishek Jain, Yael Kalai and Ron Rothblum. (CRYPTO 2017) - New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs
with Saikrishna Badrinarayanan, Rafail Ostrovsky and Ivan Visconti. (EUROCRYPT 2017) - Round Optimal Concurrent Non-Malleability from Polynomial Hardness
Dakshita Khurana. (TCC 2017) - 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] - Breaking the 3 Round Barrier for Non-Malleable Commitments
with Vipul Goyal and Amit Sahai. (FOCS 2016) - All Complete Functionalities are Reversible
with Daniel Kraschewski, Hemanta Maji, Manoj Prabhakaran and Amit Sahai. (EUROCRYPT 2016) - Secure Computation from Elastic Noisy Channels
with Hemanta Maji and Amit Sahai. (EUROCRYPT 2016) - 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] - Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
with Vipul Goyal, Ilya Mironov, Omkant Pandey and Amit Sahai. (ICALP 2016 - Track A) - Multi-Party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
with Vanishree Rao and Amit Sahai. (ASIACRYPT 2015) - Statistical Randomized Encodings: A Complexity Theoretic View
with Shweta Agarwal, Yuval Ishai and Anat Paskin-Cherniavsky. (ICALP 2015 - Track A) - Non-Malleable Multi-Prover Interactive Proofs and Witness Signatures
with Aayush Jain and Vipul Goyal. (Cryptology ePrint Archive 2015) - Black-Box Separations for Differentially Private Protocols
with Hemanta Maji and Amit Sahai. (ASIACRYPT 2014)