2 citations · 4 across the 8 of their papers we have counts for
10 papers
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…
Black-Box Separation Between Pseudorandom Unitaries, Pseudorandom Isometries, and Pseudorandom Function-Like States
Aditya Gulati, Yao-Ting Lin, Tomoyuki Morimae +1
Pseudorandom functions (PRFs) are one of the most fundamental primitives in classical cryptography. On the other hand, in quantum cryptography, it is possible that PRFs do not exis…
Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries
Prabhanjan Ananth, John Bostanci, Aditya Gulati +1
Gluing theorem for random unitaries [Schuster, Haferkamp, Huang, QIP 2025] have found numerous applications, including designing low depth random unitaries [Schuster, Haferkamp, Hu…
On the Limitations of Pseudorandom Unitaries
Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin
Pseudorandom unitaries (PRUs), one of the key quantum pseudorandom notions, are efficiently computable unitaries that are computationally indistinguishable from Haar random unitari…
Pseudorandom Unitaries in the Haar Random Oracle Model
Prabhanjan Ananth, John Bostanci, Aditya Gulati +1
The quantum Haar random oracle model is an idealized model where every party has access to a single Haar random unitary and its inverse. We construct strong pseudorandom unitaries…
Pseudorandomness in the (Inverseless) Haar Random Oracle Model
Prabhanjan Ananth, John Bostanci, Aditya Gulati +1
We study the (in)feasibility of quantum pseudorandom notions in a quantum analog of the random oracle model, where all the parties, including the adversary, have oracle access to t…
Cryptography in the Common Haar State Model: Feasibility Results and Separations
Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin
Common random string model is a popular model in classical cryptography. We study a quantum analogue of this model called the common Haar state (CHS) model. In this model, every pa…
A Note on the Common Haar State Model
Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin
Common random string model is a popular model in classical cryptography with many constructions proposed in this model. We study a quantum analogue of this model called the common…
Pseudorandom Isometries
Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu +1
We introduce a new notion called -secure pseudorandom isometries (PRI). A pseudorandom isometry is an efficient quantum circuit that maps an -qubit state to an …