Paper 2024/1500
Hard Quantum Extrapolations in Quantum Cryptography
Abstract
Although one-way functions are well-established as the minimal primitive for classical cryptography, a minimal primitive for quantum cryptography is still unclear. Universal extrapolation, first considered by Impagliazzo and Levin (1990), is hard if and only if one-way functions exist. Towards better understanding minimal assumptions for quantum cryptography, we study the quantum analogues of the universal extrapolation task. Specifically, we put forth the classical
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- mutually unbiased basescliffordunitary designs
- Contact author(s)
-
luowen @ qcry pt
jraizes @ cmu edu
mzhandry @ gmail com - History
- 2024-10-07: revised
- 2024-09-24: received
- See all versions
- Short URL
- https://ia.cr/2024/1500
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1500, author = {Luowen Qian and Justin Raizes and Mark Zhandry}, title = {Hard Quantum Extrapolations in Quantum Cryptography}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1500}, year = {2024}, url = {https://eprint.iacr.org/2024/1500} }