Introdusert i [EC:YamZha21](https://eprint.iacr.org/2020/1270): > (...) we give lifting theorems from security in the ROM to that in the QROM for certain types of cryptographic schemes and security notions. For example, our lifting theorems are applicable to [[Fiat-Shamir]] non-interactive arguments, Fiat-Shamir signatures, and Full-Domain-Hash signatures etc. We also discuss applications of our lifting theorems to quantum query complexity. Teoremet: > Theorem 1.1 (Lifting Theorem for Search-Type Game, Informal). *For any search-type game where a challenger makes constant number of queries to the random oracle, if the game is hard in the ROM, then that is also hard in the QROM.* Andre lifting-teoremer: > Though several works (BDF+11, Son14, ZYF+19, KS20) give lifting theorems from ROM security to QROM security, they assume certain conditions for security proofs in the ROM. On the other hand, our lifting theorem for search-type games only requires syntactic conditions of schemes and their security notions, and do not assume anything about security proofs in the ROM. Our lifting theorem for digital signatures requires slightly more involved conditions, but we believe that it is much easier to check them than to check that a security proof in the ROM relies on a certain type of reductions.