TY - JOUR

T1 - On basing one-way permutations on np-hard problems under quantum reductions

AU - Chia, Nai Hui

AU - Hallgren, Sean

AU - Song, Fang

N1 - Funding Information:
Sean Hallgren: Partially supported by National Science Foundation awards CNS-1617802 and CCF-1618287, and by the National Security Agency (NSA) under Army Research Office (ARO) contract number W911NF-12-1-0541.
Publisher Copyright:
© 2020 Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften. All rights reserved.

PY - 2020/8/27

Y1 - 2020/8/27

N2 - A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions. However, for many other classes such as NP, the evidence so far is typically negative, in the sense that the existence of such reductions would cause collapses of the polynomial hierarchy(PH). Basing cryptographic primitives, e.g., the average-case hardness of inverting one-way permutations, on NP-completeness is a particularly intriguing instance. As there is evidence showing that classical reductions from NP-hard problems to breaking these primitives result in PH collapses, it seems unlikely to base cryptographic primitives on NP-hard problems. Nevertheless, these results do not rule out the possibilities of the existence of quantum reductions. In this work, we initiate a study of the quantum analogues of these questions. Aside from formalizing basic notions of quantum reductions and demonstrating powers of quantum reductions by examples of separations, our main result shows that if NP-complete problems reduce to inverting one-way permutations using certain types of quantum reductions, then coNP ⊆ QIP(2).

AB - A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions. However, for many other classes such as NP, the evidence so far is typically negative, in the sense that the existence of such reductions would cause collapses of the polynomial hierarchy(PH). Basing cryptographic primitives, e.g., the average-case hardness of inverting one-way permutations, on NP-completeness is a particularly intriguing instance. As there is evidence showing that classical reductions from NP-hard problems to breaking these primitives result in PH collapses, it seems unlikely to base cryptographic primitives on NP-hard problems. Nevertheless, these results do not rule out the possibilities of the existence of quantum reductions. In this work, we initiate a study of the quantum analogues of these questions. Aside from formalizing basic notions of quantum reductions and demonstrating powers of quantum reductions by examples of separations, our main result shows that if NP-complete problems reduce to inverting one-way permutations using certain types of quantum reductions, then coNP ⊆ QIP(2).

UR - http://www.scopus.com/inward/record.url?scp=85092043004&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85092043004&partnerID=8YFLogxK

U2 - 10.22331/q-2020-08-27-312

DO - 10.22331/q-2020-08-27-312

M3 - Article

AN - SCOPUS:85092043004

VL - 4

JO - Quantum

JF - Quantum

SN - 2521-327X

ER -