Showing cs.CRShow all
3 papers · 1 filter
cs.CR2025
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…
cs.CR2024
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…
cs.CR2024
A Modular Approach to Unclonable Cryptography
Prabhanjan Ananth, Amit Behera
We explore a new pathway to designing unclonable cryptographic primitives. We propose a new notion called unclonable puncturable obfuscation (UPO) and study its implications for un…