Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 46 min ago
PreprintCC BY 4.0arXiv

EFI⇔1PRS

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.

BibTeX
@misc{batra2026efi1prs,
  title = {{$\mathsfEFI\Leftrightarrow\mathsf1PRS$}},
  author = {Rishabh Batra},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.18799},
  eprint = {2610.18799},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.18799},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - EFI⇔1PRS
AU  - Rishabh Batra
PY  - 2026
DA  - 2026/10/13
PB  - arXiv
DO  - 10.48550/arxiv.2610.18799
UR  - https://arxiv.org/abs/2610.18799
AB  - 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.
ER  -