Ensuring tight computational security against higher-order DPA attacks. - Dakshita Khurana; Aditya Gaurav (PST, 2011)

A grammar-based GUI for single view reconstruction. - Dakshita Khurana; Surabhi Sankhla; Abhinav Shukla; Richa Varshney; Prem Kalra; Subhashis Banerjee (ICVGIP, 2012)

Black Box Separations for Differentially Private Protocols. - Dakshita Khurana; Hemanta K. Maji; Amit Sahai (IACR Cryptol. ePrint Arch., 2014)

How to Generate and use Universal Parameters. - Dakshita Khurana; Amit Sahai; Brent Waters (IACR Cryptol. ePrint Arch., 2014)

Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation. - Dakshita Khurana; Vanishree Rao; Amit Sahai (ASIACRYPT (1), 2015)

Statistical Randomized Encodings: A Complexity Theoretic View. - Shweta Agrawal 001; Yuval Ishai; Dakshita Khurana; Anat Paskin-Cherniavsky (ICALP (1), 2015)

Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs. - Vipul Goyal; Aayush Jain; Dakshita Khurana (IACR Cryptol. ePrint Arch., 2015)

Do Distributed Differentially-Private Protocols Require Oblivious Transfer? - Vipul Goyal; Dakshita Khurana; Ilya Mironov; Omkant Pandey; Amit Sahai (IACR Cryptol. ePrint Arch., 2015)

How to Generate and Use Universal Samplers. - Dennis Hofheinz; Tibor Jager; Dakshita Khurana; Amit Sahai; Brent Waters; Mark Zhandry (ASIACRYPT (2), 2016)

Breaking the Three Round Barrier for Non-malleable Commitments. - Vipul Goyal; Dakshita Khurana; Amit Sahai (FOCS, 2016)

New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs. - Saikrishna Badrinarayanan; Dakshita Khurana; Rafail Ostrovsky; Ivan Visconti (IACR Cryptol. ePrint Arch., 2016)

Secure Computation from Elastic Noisy Channels. - Dakshita Khurana; Hemanta K. Maji; Amit Sahai (IACR Cryptol. ePrint Arch., 2016)

All Complete Functionalities are Reversible. - Daniel Kraschewski; Dakshita Khurana; Hemanta K. Maji; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2016)

Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs. - Saikrishna Badrinarayanan; Dakshita Khurana; Rafail Ostrovsky; Ivan Visconti (EUROCRYPT (1), 2017)

How to Achieve Non-Malleability in One or Two Rounds. - Dakshita Khurana; Amit Sahai (Electron. Colloquium Comput. Complex., 2017)

Round Optimal Concurrent MPC via Strong Simulation. - Saikrishna Badrinarayanan; Vipul Goyal; Abhishek Jain 002; Dakshita Khurana; Amit Sahai (IACR Cryptol. ePrint Arch., 2017)

Promise Zero Knowledge and its Applications to Round Optimal MPC. - Saikrishna Badrinarayanan; Vipul Goyal; Abhishek Jain 002; Yael Tauman Kalai; Dakshita Khurana; Amit Sahai (IACR Cryptol. ePrint Arch., 2017)

Distinguisher-Dependent Simulation in Two Rounds and its Applications. - Abhishek Jain 002; Yael Tauman Kalai; Dakshita Khurana; Ron Rothblum (IACR Cryptol. ePrint Arch., 2017)

Round Optimal Concurrent Non-Malleability from Polynomial Hardness. - Dakshita Khurana (IACR Cryptol. ePrint Arch., 2017)

Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions. - Dakshita Khurana; Amit Sahai (IACR Cryptol. ePrint Arch., 2017)

Succinct delegation for low-space non-deterministic computation. - Saikrishna Badrinarayanan; Yael Tauman Kalai; Dakshita Khurana; Amit Sahai; Daniel Wichs (STOC, 2018)

Non-Interactive Delegation for Low-Space Non-Deterministic Computation. - Saikrishna Badrinarayanan; Yael Kalai; Dakshita Khurana; Amit Sahai; Daniel Wichs (Electron. Colloquium Comput. Complex., 2018)

Non-Interactive Non-Malleability from Quantum Supremacy. - Yael Kalai; Dakshita Khurana (Electron. Colloquium Comput. Complex., 2018)

Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness. - Prabhanjan Ananth; Aayush Jain; Dakshita Khurana; Amit Sahai (IACR Cryptol. ePrint Arch., 2018)

Upgrading to Functional Encryption. - Saikrishna Badrinarayanan; Dakshita Khurana; Amit Sahai; Brent Waters (IACR Cryptol. ePrint Arch., 2018)

Statistical Witness Indistinguishability (and more) in Two Messages. - Yael Tauman Kalai; Dakshita Khurana; Amit Sahai (IACR Cryptol. ePrint Arch., 2018)

Round Optimal Black-Box “Commit-and-Prove”. - Dakshita Khurana; Rafail Ostrovsky; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

How to Rewind with Minimal Interaction. - Dakshita Khurana (2018)

Statistical ZAP Arguments. - Saikrishna Badrinarayanan; Rex Fernando; Aayush Jain; Dakshita Khurana; Amit Sahai (IACR Cryptol. ePrint Arch., 2019)

Computational Extractors with Negligible Error in the CRS Model. - Ankit Garg; Yael Tauman Kalai; Dakshita Khurana (IACR Cryptol. ePrint Arch., 2019)

Weak Zero-Knowledge beyond the Black-Box Barrier. - Nir Bitansky; Dakshita Khurana; Omer Paneth (SIAM J. Comput., 2019)

Low Error Efficient Computational Extractors in the CRS Model. - Ankit Garg; Yael Tauman Kalai; Dakshita Khurana (EUROCRYPT (1), 2020)

Post-Quantum Multi-Party Computation in Constant Rounds. - Amit Agarwal; James Bartusek; Vipul Goyal; Dakshita Khurana; Giulio Malavolta (CoRR, 2020)

Post-Quantum Multi-Party Computation. - Amit Agarwal; James Bartusek; Vipul Goyal; Dakshita Khurana; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2020)

On The Round Complexity of Two-Party Quantum Computation. - James Bartusek; Andrea Coladangelo; Dakshita Khurana; Fermi Ma (IACR Cryptol. ePrint Arch., 2020)

One-Way Functions Imply Secure Computation in a Quantum World. - James Bartusek; Andrea Coladangelo; Dakshita Khurana; Fermi Ma (IACR Cryptol. ePrint Arch., 2020)

Black-Box Non-Interactive Non-Malleable Commitments. - Rachit Garg 001; Dakshita Khurana; George Lu; Brent Waters (IACR Cryptol. ePrint Arch., 2020)

Lossy Correlation Intractability and PPAD Hardness from Sub-exponential LWE. - Ruta Jawale; Dakshita Khurana (IACR Cryptol. ePrint Arch., 2020)

SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE. - Ruta Jawale; Yael Tauman Kalai; Dakshita Khurana; Rachel Yun Zhang (IACR Cryptol. ePrint Arch., 2020)

On Statistical Security in Two-Party Computation. - Dakshita Khurana; Muhammad Haris Mughees (IACR Cryptol. ePrint Arch., 2020)

On the Round Complexity of Secure Quantum Computation. - James Bartusek; Andrea Coladangelo; Dakshita Khurana; Fermi Ma (CRYPTO (1), 2021)

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. - Amit Agarwal; James Bartusek; Vipul Goyal; Dakshita Khurana; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2021)

Compact Ring Signatures from Learning With Errors. - Rohit Chatterjee; Sanjam Garg; Mohammad Hajiabadi; Dakshita Khurana; Xiao Liang 014; Giulio Malavolta; Omkant Pandey; Sina Shiehian (IACR Cryptol. ePrint Arch., 2021)

On the Round Complexity of Black-box Secure MPC. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2021)

Non-interactive Distributional Indistinguishability (NIDI) and Non-Malleable Commitments. - Dakshita Khurana (IACR Cryptol. ePrint Arch., 2021)

Improved Computational Extractors and their Applications. - Dakshita Khurana; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2021)

On the CCA Compatibility of Public-Key Infrastructure. - Dakshita Khurana; Brent Waters (IACR Cryptol. ePrint Arch., 2021)

On Non-uniform Security for Black-box Non-Interactive CCA Commitments. - Rachit Garg 001; Dakshita Khurana; George Lu; Brent Waters (IACR Cryptol. ePrint Arch., 2022)

A New Framework for Quantum Oblivious Transfer. - Amit Agarwal; James Bartusek; Dakshita Khurana; Nishant Kumar 001 (IACR Cryptol. ePrint Arch., 2022)

Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC. - Saikrishna Badrinarayanan; Yuval Ishai; Dakshita Khurana; Amit Sahai; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Cryptography with Certified Deletion. - James Bartusek; Dakshita Khurana (IACR Cryptol. ePrint Arch., 2022)

COA-Secure Obfuscation and Applications. - Ran Canetti; Suvradip Chakraborty; Dakshita Khurana; Nishant Kumar 001; Oxana Poburinnaya; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2022)

SNARGs for P from Sub-exponential DDH and QR. - James Hulett; Ruta Jawale; Dakshita Khurana; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Round-Optimal Black-Box Protocol Compilers. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Weak Zero-Knowledge via the Goldreich-Levin Theorem. - Dakshita Khurana; Giulio Malavolta; Kabir Tomer (ASIACRYPT (2), 2023)

On Black-Box Verifiable Outsourcing. - Amit Agarwal; Navid Alamati; Dakshita Khurana; Srinivasan Raghuraman; Peter Rindal (IACR Cryptol. ePrint Arch., 2023)

Obfuscation and Outsourced Computation with Certified Deletion. - James Bartusek; Sanjam Garg; Vipul Goyal; Dakshita Khurana; Giulio Malavolta; Justin Raizes; Bhaskar Roberts (IACR Cryptol. ePrint Arch., 2023)

Weakening Assumptions for Publicly-Verifiable Deletion. - James Bartusek; Dakshita Khurana; Giulio Malavolta; Alexander Poremba; Michael Walter 005 (IACR Cryptol. ePrint Arch., 2023)

Publicly-Verifiable Deletion via Target-Collapsing Functions. - James Bartusek; Dakshita Khurana; Alexander Poremba (IACR Cryptol. ePrint Arch., 2023)

Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). - James Bartusek; Dakshita Khurana; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2023)

Black-Box Reusable NISC with Random Oracles. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2023)

Round-Optimal Black-Box MPC in the Plain Model. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2023)

Unclonable Non-Interactive Zero-Knowledge. - Ruta Jawale; Dakshita Khurana (IACR Cryptol. ePrint Arch., 2023)

Commitments from Quantum One-Wayness. - Dakshita Khurana; Kabir Tomer (IACR Cryptol. ePrint Arch., 2023)

Software with Certified Deletion. - James Bartusek; Vipul Goyal; Dakshita Khurana; Giulio Malavolta; Justin Raizes; Bhaskar Roberts (EUROCRYPT (4), 2024)

On the Power of Oblivious State Preparation. - James Bartusek; Dakshita Khurana (IACR Cryptol. ePrint Arch., 2024)

Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P-Hardness. - Dakshita Khurana; Kabir Tomer (IACR Cryptol. ePrint Arch., 2024)

On Weak NIZKs, One-way Functions and Amplification. - Suvradip Chakraborty; James Hulett; Dakshita Khurana (IACR Cryptol. ePrint Arch., 2025)

MPC in the Quantum Head (or: Superposition-Secure (Quantum) Zero-Knowledge). - Andrea Coladangelo; Ruta Jawale; Dakshita Khurana; Giulio Malavolta; Hendrik Waldner (CoRR, 2025)