19 citations · 56 across the 28 of their papers we have counts for
35 papers
Quantum Time-Lock Puzzles in the Quantum Random Oracle Model
Prabhanjan Ananth, Yao-Ting Lin
A time-lock puzzle allows a sender to hide a message in a puzzle such that recovering the message requires substantially more sequential computation than the time required to gener…
Non-Local Search-to-Decision Reduction over F2, and More
Prabhanjan Ananth
Non-local search-to-decision asks whether the difficulty of two non-communicating (non-local) parties both predicting x given a bipartite state (that possibly depends on x) implies…
Unconditional Unclonable Encryption
Prabhanjan Ananth, Amit Sahai, Seyoon Ragavan
We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption for one-bit messages, with efficient encryption and decryption…
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…