2 citations · 8 across the 15 of their papers we have counts for
21 papers
The Entire Quantum Computer on a Classical Leash
Yael Tauman Kalai, Dakshita Khurana, Justin Raizes
We show that a classical client with no quantum hardware can use a single untrusted and potentially malicious quantum server as if it were its own trusted quantum computer. Through…
How to Build Pseudorandom Unitaries in Microcrypt
Aditya Gulati, Dakshita Khurana, Kabir Tomer
We provide the first evidence relative to a classical oracle that pseudorandom unitaries (PRUs) can exist without quantum-computable one-way functions. To obtain this result, we fi…
How Not to Build Microcrypt
Aditya Gulati, Dakshita Khurana, Kabir Tomer
A key challenge in quantum cryptography is to build quantum one-wayness and pseudorandomness without the use of (quantum computable) one-way functions. So far, this has turned out…
Unconditional Certified Randomness without Structure
Andrea Coladangelo, Dakshita Khurana, Saachi Mutreja +3
We obtain a certified randomness protocol in the quantum random oracle model. The protocol is non-interactive and publicly verifiable with a classical verifier, and is based on Yam…
Certified Randomness without Structure Against Shallow-Query Adversaries
Dakshita Khurana, Bhaskar Roberts, Avishay Tal
In a recent breakthrough, Yamakawa and Zhandry (J. ACM 2024) constructed a proof of quantumness in the quantum random oracle model (QROM) in which the quantum prover samples a code…
Non-Trivial Zero-Knowledge Implies One-Way Functions
Suvradip Chakraborty, James Hulett, Dakshita Khurana +1
A recent breakthrough [Hirahara and Nanashima, STOC'2024] established that if , the existence of zero-knowledge with negligible errors…
How to Classically Verify a Quantum Cat without Killing It
Yael Tauman Kalai, Dakshita Khurana, Justin Raizes
A quantum verifier decides membership in QMA using a (single) quantum witness state. This witness may be arbitrary, and no requirement is placed on it beyond its acceptance probabi…
On the Cryptographic Futility of Non-Collapsing Measurements
Alper Cakan, Dakshita Khurana, Tomoyuki Morimae +3
We investigate quantum analogues of collision resistance and obtain separations between quantum ``one-way'' and ``collision-resistant'' primitives. 1. Our first result studies one-…
MPC in the Quantum Head (or: Superposition-Secure (Quantum) Zero-Knowledge)
Andrea Coladangelo, Ruta Jawale, Dakshita Khurana +2
The MPC-in-the-head technique (Ishai et al., STOC 2007) is a celebrated method to build zero-knowledge protocols with desirable theoretical properties and high practical efficiency…
On the Power of Oblivious State Preparation
James Bartusek, Dakshita Khurana
We put forth Oblivious State Preparation (OSP) as a cryptographic primitive that unifies techniques developed in the context of a quantum server interacting with a classical client…
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from -Hardness
Dakshita Khurana, Kabir Tomer
Recent oracle separations [Kretschmer, TQC'21, Kretschmer et. al., STOC'23] have raised the tantalizing possibility of building quantum cryptography from sources of hardness that p…
Commitments from Quantum One-Wayness
Dakshita Khurana, Kabir Tomer
One-way functions are central to classical cryptography. They are both necessary for the existence of non-trivial classical cryptosystems, and sufficient to realize meaningful prim…
Unclonable Non-Interactive Zero-Knowledge
Ruta Jawale, Dakshita Khurana
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets about them. However, an adversary that obtains a NIZK proof may be able to clone t…
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)
James Bartusek, Dakshita Khurana, Akshayaram Srinivasan
Can a sender non-interactively transmit one of two strings to a receiver without knowing which string was received? Does there exist minimally-interactive secure multiparty computa…
Weakening Assumptions for Publicly-Verifiable Deletion
James Bartusek, Dakshita Khurana, Giulio Malavolta +2
We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state ge…
Publicly-Verifiable Deletion via Target-Collapsing Functions
James Bartusek, Dakshita Khurana, Alexander Poremba
We build quantum cryptosystems that support publicly-verifiable deletion from standard cryptographic assumptions. We introduce target-collapsing as a weakening of collapsing for ha…
A New Framework for Quantum Oblivious Transfer
Amit Agarwal, James Bartusek, Dakshita Khurana +1
We present a new template for building oblivious transfer from quantum information that we call the "fixed basis" framework. Our framework departs from prior work (eg., Crepeau and…
Cryptography with Certified Deletion
James Bartusek, Dakshita Khurana
We propose a new, unifying framework that yields an array of cryptographic primitives with certified deletion. These primitives enable a party in possession of a quantum ciphertext…
One-Way Functions Imply Secure Computation in a Quantum World
James Bartusek, Andrea Coladangelo, Dakshita Khurana +1
We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functio…
On The Round Complexity of Secure Quantum Computation
James Bartusek, Andrea Coladangelo, Dakshita Khurana +1
We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries.…
Post-Quantum Multi-Party Computation
Amit Agarwal, James Bartusek, Vipul Goyal +2
We initiate the study of multi-party computation for classical functionalities (in the plain model) with security against malicious polynomial-time quantum adversaries. We observe…