7 papers
Unconditional Unclonable Encryption
Prabhanjan Ananth, Amit Sahai
We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption scheme for one-bit messages, with efficient encryption and decr…
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…
Revocable Encryption, Programs, and More: The Case of Multi-Copy Security
Prabhanjan Ananth, Saachi Mutreja, Alexander Poremba
Fundamental principles of quantum mechanics have inspired many new research directions, particularly in quantum cryptography. One such principle is quantum no-cloning which has led…
Ideal Pseudorandom Codes
Omar Alrabiah, Prabhanjan Ananth, Miranda Christ +2
Pseudorandom codes are error-correcting codes with the property that no efficient adversary can distinguish encodings from uniformly random strings. They were recently introduced b…