A Meta-Complexity Characterization of Minimal Quantum Cryptography

We give a meta-complexity characterization of EFI pairs, which are considered the "minimal" primitive in quantum cryptography and are equivalent to quantum commitments. More precisely, we show that the existence of EFI pairs is equivalent to the following: there exists a non-uniformly samplable...

The Hardness of Learning Quantum Circuits and Its Cryptographic Applications

We show that concrete hardness assumptions about learning or cloning the output state of a random quantum circuit can be used as the foundation for secure quantum cryptography. In particular, under these assumptions we construct secure one-way state generators OWSGs, digital signature schemes,...

Quantum Pseudoresources Imply Cryptography

While one-way functions OWFs serve as the minimal assumption for computational cryptography in the classical setting, in quantum cryptography, we have even weaker cryptographic assumptions such as pseudo-random states, and EFI pairs, among others. Moreover, the minimal assumption for computationa...