Quantum commitments and signatures without one-way functions
Tomoyuki Morimae, Takashi Yamakawa

TL;DR
This paper demonstrates that quantum cryptographic primitives like commitments and signatures can exist without relying on quantum-secure classical one-way functions, using pseudorandom quantum states.
Contribution
It introduces constructions of quantum commitments and signatures based on pseudorandom quantum states, bypassing the need for classical one-way functions.
Findings
Quantum commitments can be constructed from pseudorandom quantum states.
Quantum signatures can be built from pseudorandom quantum states.
These primitives can exist even if no quantum-secure classical cryptographic primitive exists.
Abstract
In the classical world, the existence of commitments is equivalent to the existence of one-way functions. In the quantum setting, on the other hand, commitments are not known to imply one-way functions, but all known constructions of quantum commitments use at least one-way functions. Are one-way functions really necessary for commitments in the quantum world? In this work, we show that non-interactive quantum commitments (for classical messages) with computational hiding and statistical binding exist if pseudorandom quantum states exist. Pseudorandom quantum states are sets of quantum states that are efficiently generated but their polynomially many copies are computationally indistinguishable from the same number of copies of Haar random states [Ji, Liu, and Song, CRYPTO 2018]. It is known that pseudorandom quantum states exist even if (relative to a quantum oracle)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Cryptography and Data Security
