Commitments are Equivalent to Statistically-Verifiable One-Way State Generators
Rishabh Batra, Rahul Jain
摘要
One-way state generators (OWSG) [MY22a] are natural quantum analogs to classical one-way functions. We consider statistically-verifiable OWSGs (sv-OWSG), which are potentially weaker objects than OWSGs. We show that O ´n logpnq ¯-copy sv-OWSGs (n represents the input length) are equivalent to polypnq-copy sv-OWSGs and to quantum commitments. Since known results show that o ´n logpnq ¯-copy OWSGs cannot imply commitments [CGG `23], this shows that O ´n logpnq ¯-copy sv-OWSGs are the weakest OWSGs from which we can get commitments (and hence much of quantum cryptography).
Our construction follows along the lines of Håstad, Impagliazzo, Levin and Luby [HILL99], who obtained classical pseudorandom generators (PRG) from classical one-way functions (OWF), however with crucial modifications. Our construction, when applied to the classical case, provides an alternative to the construction provided by [HILL99] to obtain a classical mildly non-uniform PRG from any classical OWF. Since we do not argue conditioned on the output f pxq, our construction and analysis is arguably simpler and may be of independent interest. For converting a mildly non-uniform PRG to a uniform PRG, we can use the same construction as [HILL99].
logpnq for some constant c ą 0. An m-copy sv-OWSG implies oblivious transfer and secure multi-party computation for all functionalities.
We show the converse to Corollary 2 is also true.
Combining the above results we get: Corollary 5. The following cryptographic primitives are equivalent:
• polypnq-copy sv-OWSG,
A natural question that can be asked at this point is whether an o ´n logpnq ¯-copy sv-OWSG implies a polypnq-copy sv-OWSG (equivalently EFI)? Cavalar et al. [CGG `23] show that o ´n logpnq ¯copy pure-state output OWSGs (that are potentially stronger than sv-OWSGs) with statistical security exist unconditionally. Hence they cannot imply an EFI unless EFIs also exist unconditionally. This gives the following corollary.
Corollary 6. Unless EFIs exist unconditionally, O ´n logpnq ¯-copy sv-OWSGs are the weakest OWSGs from which we can get an EFI, equivalently, commitment schemes.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- A Meta-complexity Characterization of Minimal Quantum CryptographyBruno Cavalar, Boyang Chen, Andrea Coladangelo, Matthew Gray 等STOC 2026 · 被引用 4 次
- Quantum Cryptography and Meta-ComplexityTaiga Hiroka, Tomoyuki MorimaeCRYPTO 2025 · 被引用 3 次
它引用的顶会 Paper6
- Cryptography from Pseudorandom Quantum StatesPrabhanjan Ananth, Luowen Qian, Henry YuenCRYPTO 2022 · 被引用 78 次
- Quantum Commitments and Signatures Without One-Way FunctionsTomoyuki Morimae, Takashi YamakawaCRYPTO 2022 · 被引用 74 次
- One-Way Functions Imply Secure Computation in a Quantum WorldJames Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi MaCRYPTO 2021 · 被引用 57 次
- Oblivious Transfer Is in MiniQCryptAlex B. Grilo, Huijia Lin, Fang Song, Vinod VaikuntanathanEUROCRYPT 2021 · 被引用 56 次
- Quantum Cryptography in AlgorithmicaWilliam Kretschmer, Luowen Qian, Makrand Sinha, Avishay TalSTOC 2023 · 被引用 47 次
相关 Paper
- Commitments from Quantum One-WaynessDakshita Khurana, Kabir TomerSTOC 2024 · 被引用 21 次
- Oracle Separation Between Quantum Commitments and Quantum One-WaynessJohn Bostanci, Boyang Chen, Barak NehoranEUROCRYPT 2025 · 被引用 3 次
- Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P HardnessDakshita Khurana, Kabir TomerSTOC 2025 · 被引用 2 次
- On Central Primitives for Quantum Cryptography with Classical CommunicationKai-Min Chung, Eli Goldin, Matthew GrayCRYPTO 2024 · 被引用 11 次
- Hard Quantum Extrapolations in Quantum CryptographyLuowen Qian, Justin Raizes, Mark ZhandryEUROCRYPT 2025 · 被引用 1 次
