Verifiable Quantum Advantage without Structure

04/05/2022
by   Takashi Yamakawa, et al.
0

We show the following hold, unconditionally unless otherwise stated, relative to a random oracle with probability 1: - There are NP search problems solvable by BQP machines but not BPP machines. - There exist functions that are one-way, and even collision resistant, against classical adversaries but are easily inverted quantumly. Similar separations hold for digital signatures and CPA-secure public key encryption (the latter requiring the assumption of a classically CPA-secure encryption scheme). Interestingly, the separation does not necessarily extend to the case of other cryptographic objects such as PRGs. - There are unconditional publicly verifiable proofs of quantumness with the minimal rounds of interaction: for uniform adversaries, the proofs are non-interactive, whereas for non-uniform adversaries the proofs are two message public coin. - Our results do not appear to contradict the Aaronson-Ambanis conjecture. Assuming this conjecture, there exist publicly verifiable certifiable randomness, again with the minimal rounds of interaction. By replacing the random oracle with a concrete cryptographic hash function such as SHA2, we obtain plausible Minicrypt instantiations of the above results. Previous analogous results all required substantial structure, either in terms of highly structured oracles and/or algebraic assumptions in Cryptomania and beyond.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/13/2021

Quantum commitments and signatures without one-way functions

In the classical world, the existence of commitments is equivalent to th...
research
01/23/2023

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions

Public-key quantum money is a cryptographic proposal for using highly en...
research
04/06/2023

Non-Interactive Quantum Key Distribution

Quantum key distribution (QKD) allows Alice and Bob to agree on a shared...
research
03/15/2023

Publicly-Verifiable Deletion via Target-Collapsing Functions

We build quantum cryptosystems that support publicly-verifiable deletion...
research
04/14/2023

Publicly Verifiable Deletion from Minimal Assumptions

We present a general compiler to add the publicly verifiable deletion pr...
research
04/25/2019

Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability

Game-playing proofs constitute a powerful framework for classical crypto...
research
10/24/2022

Unconditional Proofs-of-Work and Other Possibilities of Thermodynamic Cryptography

In line with advances in recent years about realizing cryptographic func...

Please sign up or login with your details

Forgot password? Click here to reset