An important proof technique in the random oracle model involves reprogramming it on hard to predict inputs and arguing that an attacker cannot detect that this occurred. In the quantum setting, a particularly challenging version of this considers adaptive reprogramming wherein the points to be reprogrammed (or the output values they should be programmed to) are dependent on choices made by the adversary. Some quantum frameworks for analyzing adaptive reprogramming were given by Unruh (CRYPTO 2014, EUROCRYPT 2015), Grilo-Hövelmanns-Hülsing-Majenz (ASIACRYPT 2021), and Pan-Zeng (PKC 2024). We show, counterintuitively, that these adaptive results follow from the \emph{nonadaptive} one-way to hiding theorem of Ambainis-Hamburg-Unruh (CRYPTO 2019). These implications contradict beliefs (whether stated explicitly or implicitly) that some properties of the adaptive frameworks cannot be provided by the Ambainis-Hamburg-Unruh result.

翻译：随机预言机模型中的一项重要证明技术涉及对难以预测的输入进行重编程，并论证攻击者无法检测到这一过程的发生。在量子场景下，一个特别具有挑战性的变体是自适应重编程，其中待重编程的点（或其应被编程的输出值）取决于对手所做的选择。Unruh（CRYPTO 2014, EUROCRYPT 2015）、Grilo-Hövelmanns-Hülsing-Majenz（ASIACRYPT 2021）以及Pan-Zeng（PKC 2024）已提出若干分析自适应重编程的量子框架。我们反直觉地证明，这些自适应结果可由Ambainis-Hamburg-Unruh（CRYPTO 2019）的\\emph{非自适应}单向隐藏定理推导得出。这些推论与既有观点（无论明确表述或隐含）相悖，后者认为Ambainis-Hamburg-Unruh结果无法提供自适应框架的某些特性。