This study focuses on the quantum security of pseudorandom generators (PRGs) constructed from random oracles. The authors prove a lifting theorem that if such a PRG is unconditionally secure against classical adversaries making polynomially many queries to the random oracle, then it is also secure against quantum adversaries. The study also shows that any pseudo-deterministic quantum-oracle algorithm can be simulated by a computationally unbounded but query bounded classical-oracle algorithm with a polynomial blowup in the number of queries.
Publication date: 25 Jan 2024
Project Page: https://arxiv.org/abs/2401.14319v1
Paper: https://arxiv.org/pdf/2401.14319
