Indistinguishability Lifting for Keyed Oracles, Compressed Ideal Cipher, and More Applications

Cryptographic security proofs often involve an adversary interacting with a larger, keyed oracle that consists of potentially exponentially many independent instances of a smaller, base oracle. However, showing quantum indistinguishability between two such keyed oracles can be tricky, since a...

Compressed Permutation Oracles Revisited

The compressed permutation oracle has been used to analyze the quantum security of a number of cryptographic constructions which resisted prior techniques. However, these analyses were fundamentally limited by the poor soundness of the method: the technique was proven sound only up to $ON^1/12$...