Multi-theorem (Malicious) Designated-Verifier NIZK for QMA

Classically Verifiable NIZK for QMA with Preprocessing

We propose three constructions of classically verifiable non-interactive zero-knowledge proofs and arguments (CV-NIZK) for QMA in various preprocessing models. - We construct a CV-NIZK for QMA in the quantum secret parameter model where a trusted setup sends a quantum proving key to the prover and a classical verification key to the verifier. It is information theoretically sound and zero-knowledge. - Assuming the quantum hardness of the learning with errors problem, we construct a CV-NIZK for QMA in a model where a trusted party generates a CRS and the verifier sends an instance-independent q…

Non-interactive zero-knowledge arguments for QMA, with preprocessing

We initiate the study of non-interactive zero-knowledge (NIZK) arguments for languages in QMA. Our first main result is the following: if Learning With Errors (LWE) is hard for quantum computers, then any language in QMA has an NIZK argument with preprocessing. The preprocessing in our argument system consists of (i) the generation of a CRS and (ii) a single (instance-independent) quantum message from verifier to prover. The instance-dependent phase of our argument system involves only a single classical message from prover to verifier. Importantly, verification in our protocol is entirely cla…

移除量子证明中的交互

On Removing Interaction from Quantum Proofs

该研究证明若量子随机预言机中存在通用的类Fiat-Shamir编译器，则QMA=BQP，从而为量子协议无法直接编译为NIZK提供了正式证据。

Non-interactive classical verification of quantum computation

In a recent breakthrough, Mahadev constructed an interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. In this work, we show that this same task can in fact be performed non-interactively and in zero-knowledge. Our protocols result from a sequence of significant improvements to the original four-message protocol of Mahadev. We begin by making the first message instance-independent and moving it to an offline setup phase. We then establish a parallel repetition theorem for the resulting three-message protocol, with an asym…

使用共享 EPR 对的安全计算（或：如何以零知识方式隐形传态）

Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)

本文利用共享 EPR 对构造随机接收方一次性字符串 OT，并据此实现安全量子隐形传态及 NIZK 等应用，还提出两轮最优、无条件安全的经典功能 MPC 协议。

有界量子存储模型下证明的轮复杂度

The Round Complexity of Proofs in the Bounded Quantum Storage Model

研究有界量子存储模型下交互证明的轮压缩，提出NP/QMA的非交互统计WI证明及经典证明系统的两消息量子压缩，并给出紧致性证据。