Online-extractability in the quantum random-oracle model
We show the following generic result. Whenever a quantum query algorithm in the quantum random-oracle model outputs a classical value that is promised to be in some tight relation with for some , then can be efficiently extracted with almost certainty. The extraction is by means of a suitable simulation of the random oracle and works *online*, meaning that it is *straightline*, i.e., without rewinding, and *on-the-fly*, i.e., during the protocol execution and without disturbing it.
The technical core of our result is a new commutator bound that bounds the operator norm of the commutator of the unitary operator that describes the evolution of the compressed oracle (which is used to simulate the random oracle above) and of the measurement that extracts .
We show two applications of our generic online extractability result. We show *tight* online extractability of commit-and-open -protocols in the quantum setting, and we offer the first non-asymptotic post-quantum security proof of the *textbook* Fujisaki-Okamoto transformation, i.e, without adjustments to facilitate the proof.
|Algebraic Methods for Stronger Crypto , PRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS|
|EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques|
|Organisation||Algorithms and Complexity|
Don, J.W, Fehr, S, Majenz, C, & Schaffner, C. (2021). Online-extractability in the quantum random-oracle model.