Indistinguishability Lifting for Keyed Oracles, Compressed Ideal Cipher, and More Applications
A generic indistinguishability lifting theorem is established: if the two base oracles are indistinguishable under quantum queries, then their corresponding keyed oracles are too, up to an O(q^2) multiplicative loss in distinguishing advantage, where q is the number of queries made by the adversary.