Dakshita Khurana

Orcid: 0000-0001-5315-4503

According to our database1, Dakshita Khurana authored at least 65 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Commitments from Quantum One-Wayness.
IACR Cryptol. ePrint Arch., 2023

Unclonable Non-Interactive Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2023

Round-Optimal Black-Box MPC in the Plain Model.
IACR Cryptol. ePrint Arch., 2023

Black-Box Reusable NISC with Random Oracles.
IACR Cryptol. ePrint Arch., 2023

Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge).
IACR Cryptol. ePrint Arch., 2023

Publicly-Verifiable Deletion via Target-Collapsing Functions.
IACR Cryptol. ePrint Arch., 2023

Weakening Assumptions for Publicly-Verifiable Deletion.
IACR Cryptol. ePrint Arch., 2023

Obfuscation and Outsourced Computation with Certified Deletion.
IACR Cryptol. ePrint Arch., 2023

On Black-Box Verifiable Outsourcing.
IACR Cryptol. ePrint Arch., 2023

Weak Zero-Knowledge via the Goldreich-Levin Theorem.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT.
IACR Cryptol. ePrint Arch., 2022

Round-Optimal Black-Box Protocol Compilers.
IACR Cryptol. ePrint Arch., 2022

SNARGs for P from Sub-exponential DDH and QR.
IACR Cryptol. ePrint Arch., 2022

COA-Secure Obfuscation and Applications.
IACR Cryptol. ePrint Arch., 2022

Cryptography with Certified Deletion.
IACR Cryptol. ePrint Arch., 2022

Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC.
IACR Cryptol. ePrint Arch., 2022

A New Framework for Quantum Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2022

On Non-uniform Security for Black-box Non-Interactive CCA Commitments.
IACR Cryptol. ePrint Arch., 2022

2021
On the CCA Compatibility of Public-Key Infrastructure.
IACR Cryptol. ePrint Arch., 2021

Improved Computational Extractors and their Applications.
IACR Cryptol. ePrint Arch., 2021

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

On the Round Complexity of Black-box Secure MPC.
IACR Cryptol. ePrint Arch., 2021

Compact Ring Signatures from Learning With Errors.
IACR Cryptol. ePrint Arch., 2021

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation.
IACR Cryptol. ePrint Arch., 2021

On the Round Complexity of Secure Quantum Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
On Statistical Security in Two-Party Computation.
IACR Cryptol. ePrint Arch., 2020

SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE.
IACR Cryptol. ePrint Arch., 2020

Lossy Correlation Intractability and PPAD Hardness from Sub-exponential LWE.
IACR Cryptol. ePrint Arch., 2020

Black-Box Non-Interactive Non-Malleable Commitments.
IACR Cryptol. ePrint Arch., 2020

One-Way Functions Imply Secure Computation in a Quantum World.
IACR Cryptol. ePrint Arch., 2020

On The Round Complexity of Two-Party Quantum Computation.
IACR Cryptol. ePrint Arch., 2020

Post-Quantum Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2020

Post-Quantum Multi-Party Computation in Constant Rounds.
CoRR, 2020

Low Error Efficient Computational Extractors in the CRS Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
Computational Extractors with Negligible Error in the CRS Model.
IACR Cryptol. ePrint Arch., 2019

Statistical ZAP Arguments.
IACR Cryptol. ePrint Arch., 2019

Weak zero-knowledge beyond the black-box barrier.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
How to Rewind with Minimal Interaction.
PhD thesis, 2018

Round Optimal Black-Box “Commit-and-Prove”.
IACR Cryptol. ePrint Arch., 2018

Statistical Witness Indistinguishability (and more) in Two Messages.
IACR Cryptol. ePrint Arch., 2018

Upgrading to Functional Encryption.
IACR Cryptol. ePrint Arch., 2018

Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2018

Non-Interactive Non-Malleability from Quantum Supremacy.
Electron. Colloquium Comput. Complex., 2018

Non-Interactive Delegation for Low-Space Non-Deterministic Computation.
Electron. Colloquium Comput. Complex., 2018

Succinct delegation for low-space non-deterministic computation.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions.
IACR Cryptol. ePrint Arch., 2017

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

Distinguisher-Dependent Simulation in Two Rounds and its Applications.
IACR Cryptol. ePrint Arch., 2017

Promise Zero Knowledge and its Applications to Round Optimal MPC.
IACR Cryptol. ePrint Arch., 2017

Round Optimal Concurrent MPC via Strong Simulation.
IACR Cryptol. ePrint Arch., 2017

How to Achieve Non-Malleability in One or Two Rounds.
Electron. Colloquium Comput. Complex., 2017

Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
All Complete Functionalities are Reversible.
IACR Cryptol. ePrint Arch., 2016

Secure Computation from Elastic Noisy Channels.
IACR Cryptol. ePrint Arch., 2016

New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs.
IACR Cryptol. ePrint Arch., 2016

Breaking the Three Round Barrier for Non-malleable Commitments.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

How to Generate and Use Universal Samplers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
IACR Cryptol. ePrint Arch., 2015

Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2015

Statistical Randomized Encodings: A Complexity Theoretic View.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
How to Generate and use Universal Parameters.
IACR Cryptol. ePrint Arch., 2014

Black Box Separations for Differentially Private Protocols.
IACR Cryptol. ePrint Arch., 2014

2012
A grammar-based GUI for single view reconstruction.
Proceedings of the Eighth Indian Conference on Vision, Graphics and Image Processing, 2012

2011
Ensuring tight computational security against higher-order DPA attacks.
Proceedings of the Ninth Annual Conference on Privacy, Security and Trust, 2011


  Loading...