Pseudorandom Unitaries in the Haar Random Oracle Model

September 29, 2025 Β· Declared Dead Β· πŸ› Advances in Cryptology, CRYPTO 2025 Proceedings, Part II, Lecture Notes in Computer Science, volume 16001, pages 301-333

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin arXiv ID 2509.24432 Category quant-ph: Quantum Computing Cross-listed cs.CR Citations 0 Venue Advances in Cryptology, CRYPTO 2025 Proceedings, Part II, Lecture Notes in Computer Science, volume 16001, pages 301-333 Last Checked 4 months ago
Abstract
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 in the quantum Haar random oracle model. This strictly improves upon prior works who either only prove the existence of pseudorandom unitaries in the inverseless quantum Haar random oracle model [Ananth, Bostanci, Gulati, Lin, EUROCRYPT 2025] or prove the existence of a weaker notion (implied by strong pseudorandom unitaries) in the quantum Haar random oracle model [Hhan, Yamada, 2024]. Our results also present a viable approach for building quantum pseudorandomness from random quantum circuits and analyzing pseudorandom objects in nature.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted