Paper 2024/797
Nonadaptive One-Way to Hiding Implies Adaptive Quantum Reprogramming
, Georgia Institute of TechnologyAbstract
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 output values they should be programmed to) are dependent on choices made by the adversary. Frameworks for analyzing adaptive reprogramming were given by, e.g., by Unruh (CRYPTO 2014), Grilo-Hövelmanns-Hülsing-Majenz (ASIACRYPT 2021), and Pan-Zeng (PKC 2024). We show, counterintuitively, that these adaptive results follow directly from the non-adaptive 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.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Post-quantum CryptographyQuantum Random Oracle ModelOne-way to HidingProvable Security
- Contact author(s)
- josephjaeger @ gatech edu
- History
- 2024-05-25: revised
- 2024-05-23: received
- See all versions
- Short URL
- https://ia.cr/2024/797
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/797,
author = {Joseph Jaeger},
title = {Nonadaptive One-Way to Hiding Implies Adaptive Quantum Reprogramming},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/797},
year = {2024},
url = {https://eprint.iacr.org/2024/797}
}
