Introduced by Bellare and Rogaway: https://cseweb.ucsd.edu/~mihir/papers/ro.pdf Can be non-programmable or programmable, classical or quantum, leading to separate worlds. ... Although to the best of my knowledge showing that non-programmable and programmable *quantum* random oracles lead to separate worlds remains open. Showing that [[PQ-NCE and SIMstar]] is achievable *and* that Jesper's impossibility result transfers to QROs would suffice. (For an easier proof of essentially the same impossibility, see reference to and intuition behind impossibility of multi-challenge SSO* in [[SoK - Public Key Encryption with Openings]].) Are equivalent to [[Ideal Ciphers]] sans programming; probably also with programming but Martijn was less sure that this has been established. Read: - [Martijn et al's NPRO paper](https://rist.tech.cornell.edu/papers/npro.pdf) *** Se også: [[Multi-Instance Secure Public-Key Encryption]], [[SoK - Public Key Encryption with Openings]], [[Linear extractability]], [[PQ-NCE and SIMstar]], [[Domain-separated QROs]], [[Yamakawa-Zhandry]]