Ted Eaton, Combinatorics & Optimization, University of Waterloo
"The
quantum
random
oracle
model"
In cryptography, a common task is to reduce the problem of breaking an encryption or digital signature scheme to some underlying hard computational problem. This is similar to how complexity theorists reduce problems to one another to show that they are in the same complexity class.
These reductions can often be established more easily by considering different security models. A common model to employ is called the random oracle model.
However, recent results have shown that the random oracle model may be insufficient for establishing security if an attacker has access to a quantum computer. This has resulted in a new model, called the quantum random oracle model.
In this talk, I will discuss cryptographic reductions and how the random oracle model makes these reductions easier to establish, and discuss why the quantum random oracle model is needed, and some of the new difficulties that have arisen in its use.
MC 4058