Certified Everlasting Zero-Knowledge Proof for QMA

by   Taiga Hiroka, et al.

In known constructions of classical zero-knowledge protocols for NP, either of zero-knowledge or soundness holds only against computationally bounded adversaries. Indeed, achieving both statistical zero-knowledge and statistical soundness at the same time with classical verifier is impossible for NP unless the polynomial-time hierarchy collapses, and it is also believed to be impossible even with a quantum verifier. In this work, we introduce a novel compromise, which we call the certified everlasting zero-knowledge proof for QMA. It is a computational zero-knowledge proof for QMA, but the verifier issues a classical certificate that shows that the verifier has deleted its quantum information. If the certificate is valid, even unbounded malicious verifier can no longer learn anything beyond the validity of the statement. We construct a certified everlasting zero-knowledge proof for QMA. For the construction, we introduce a new quantum cryptographic primitive, which we call commitment with statistical binding and certified everlasting hiding, where the hiding property becomes statistical once the receiver has issued a valid certificate that shows that the receiver has deleted the committed information. We construct commitment with statistical binding and certified everlasting hiding from quantum encryption with certified deletion by Broadbent and Islam [TCC 2020] (in a black box way), and then combine it with the quantum sigma-protocol for QMA by Broadbent and Grilo [FOCS 2020] to construct the certified everlasting zero-knowledge proof for QMA. Our constructions are secure in the quantum random oracle model. Commitment with statistical binding and certified everlasting hiding itself is of independent interest, and there will be many other useful applications beyond zero-knowledge.



There are no comments yet.


page 1

page 2

page 3

page 4


Secure Quantum Extraction Protocols

Knowledge extraction, typically studied in the classical setting, is at ...

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds

In a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first...

Post-Quantum Zero Knowledge in Constant Rounds

We construct the first constant-round zero-knowledge classical argument ...

Post-Quantum VRF and its Applications in Future-Proof Blockchain System

A verifiable random function (VRF in short) is a powerful pseudo-random ...

Relativistic zero-knowledge protocol for NP over the internet unconditionally secure against quantum adversaries

Relativistic cryptography is a proposal for achieving unconditional secu...

Efficient simulation of random states and random unitaries

We consider the problem of efficiently simulating random quantum states ...

New Perspectives on Multi-Prover Interactive Proofs

The existing multi-prover interactive proof framework suffers from incom...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.