2610.18799
quant-ph, cs.CR
Submitted: 2026-10-13
Updated: 2026-10-13
Project page: https://sattath.github.io/microcrypt-zoo
License: http://creativecommons.org/licenses/by/4.0/
The gist: A series of recent works has established EFI pairs as the "minimal" assumption for quantum cryptography.
Abstract
A series of recent works has established EFI pairs as the "minimal" assumption for quantum cryptography. Recently, Cavalar et al. [CCC+26] showed that EFI pairs are equivalent to non-uniform expanding single-copy pseudorandom state generators (1PRS), and obtained a non-uniform meta-complexity characterization of EFI pairs. We remove the non-uniformity in their construction and prove that EFI pairs are equivalent to expanding 1PRS. As a corollary, we obtain the first uniform meta-complexity characterization of EFI pairs. Together with the equivalence of statistically verifiable one-way state generators and commitments proved by Batra and Jain [BJ24], this gives a quantum analogue of the classical equivalence between one-way functions, commitments, and pseudorandom generators.
Sources
- Commitments are equivalent to statistically-verifiable one-way state generators
- A Meta-Complexity Characterization of Minimal Quantum Cryptography
- CountCrypt: Quantum Cryptography between QCMA and PP
- Commitments from Quantum One-Wayness
- A Framework for Non-Asymptotic Quantum Information Theory
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Incoherent Imaging with Spatially Structured Quantum Probes
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources