Date Added: Mar 2012
The authors give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first unconditional proof of security for any scheme in this model. Their techniques are quite general and they use them to obtain (unconditional) security proofs for two random oracle hierarchical identity-based encryption schemes and a random oracle signature scheme, all of which have previously resisted (even conditional) quantum security proofs. They also explain how to make prior quantum random oracle security proofs unconditional. They accomplish these results by developing new tools for arguing that quantum algorithms cannot distinguish between two oracle distributions.