EFI Pairs Without One-Way Puzzles: Oracle Separations from Communication Complexity
Theorists build a classical oracle where one-way puzzles fail yet EFI pairs survive, separating two candidate minimal assumptions of quantum cryptography.
The paper constructs a single classical oracle relative to which one-way puzzles do not exist, even with an unbounded verifier, while an EFI pair survives every classical-query distinguisher holding advice, making one superposition query at the end. Security is proven by reducing adversary knowledge to communication complexity for Vector-in-Subspace, with the superposition query bounded using random matrix theory. Relative to the oracle, quantum polynomial time offers no advantage on tasks with classical inputs and outputs and there is no proof of quantumness, separating the leading minimal assumptions of quantum cryptography.
- Constructs one classical oracle where one-way puzzles fail while EFI pairs remain indistinguishable.
- Security proof reduces adversary knowledge to Vector-in-Subspace communication complexity; superposition queries bounded via random matrix theory.
- Relative to the oracle, quantum polynomial time gives no advantage on classical-input/output tasks.
- Implies no proof of quantumness relative to the oracle; conjectures address removing superposition-query restrictions.
From the original article
1 min read at arxiv.orgEFI pairs (Brakerski, Canetti, and Qian, ITCS 2023) and one-way puzzles (Khurana and Tomer, STOC 2024) are the leading candidates for the minimal assumption of quantum cryptography. The first are efficiently preparable quantum states, statistically far yet computationally indistinguishable; the second are classical puzzles, easy to sample and hard to solve.
By Atul Mantri · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.