Constructive Post-Quantum Reductions

by   Nir Bitansky, et al.

Is it possible to convert classical cryptographic reductions into post-quantum ones? It is customary to argue that while this is problematic in the interactive setting, non-interactive reductions do carry over. However, when considering quantum auxiliary input, this conversion results in a non-constructive post-quantum reduction that requires duplicating the quantum auxiliary input, which is in general inefficient or even impossible. This violates the win-win premise of provable cryptography: an attack against a cryptographic primitive should lead to an algorithmic advantage. We initiate the study of constructive quantum reductions and present positive and negative results for converting large classes of classical reductions to the post-quantum setting in a constructive manner. We show that any non-interactive non-adaptive reduction from assumptions with a polynomial solution space (such as decision assumptions) can be made post-quantum constructive. In contrast, assumptions with super-polynomial solution space (such as general search assumptions) cannot be generally converted. Along the way, we make several additional contributions: 1. We put forth a framework for reductions (or general interaction) with stateful solvers for a computational problem, that may change their internal state between consecutive calls. We show that such solvers can still be utilized. This framework and our results are meaningful even in the classical setting. 2. A consequence of our negative result is that quantum auxiliary input that is useful against a problem with a super-polynomial solution space cannot be generically “restored” post-measurement. This shows that the novel rewinding technique of Chiesa et al. (FOCS 2021) is tight in the sense that it cannot be extended beyond a polynomial measurement space.


page 1

page 2

page 3

page 4


Unitary Complexity and the Uhlmann Transformation Problem

State transformation problems such as compressing quantum information or...

Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably)

A major difficulty in quantum rewinding is the fact that measurement is ...

Proofs of Quantumness from Trapdoor Permutations

Assume that Alice can do only classical probabilistic polynomial-time co...

Post-Quantum Multi-Party Computation in Constant Rounds

We obtain the first constant-round post-quantum multi-party computation ...

Separability, Contextuality, and the Quantum Frame Problem

We study the relationship between assumptions of state separability and ...

Post-Quantum Zero-Knowledge with Space-Bounded Simulation

The traditional definition of quantum zero-knowledge stipulates that the...

Quantum Advantage from One-Way Functions

We demonstrate quantum advantage with several basic assumptions, specifi...

Please sign up or login with your details

Forgot password? Click here to reset