
PostQuantum Zero Knowledge in Constant Rounds
We construct the first constantround zeroknowledge classical argument ...
read it

A BlackBox Approach to PostQuantum ZeroKnowledge in Constant Rounds
In a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first...
read it

Classical Verification of Quantum Computations with Efficient Verifier
In this paper, we extend the protocol of classical verification of quant...
read it

On The Round Complexity of TwoParty Quantum Computation
We investigate the round complexity of maliciouslysecure twoparty quan...
read it

On the Impossibility of PostQuantum BlackBox ZeroKnowledge in Constant Rounds
We investigate the existence of constantround postquantum blackbox ze...
read it

Schrödinger's Man
What if someone built a "box" that applies quantum superposition not jus...
read it

Multitheorem (Malicious) DesignatedVerifier NIZK for QMA
We present the first noninteractive zeroknowledge argument system for ...
read it
PostQuantum MultiParty Computation in Constant Rounds
We obtain the first constantround postquantum multiparty computation protocol for general classical functionalities in the plain model, with security against malicious corruptions. We assume mildly superpolynomial quantum hardness of learning with errors (LWE), and quantum polynomial hardness of an LWEbased circular security assumption. Along the way, we also construct the following protocols that may be of independent interest. (1) Constantround zeroknowledge against parallel quantum verifiers from quantum polynomial assumptions. Here, we develop a novel parallel nocloning nonblackbox simulation technique. This uses as a starting point the recently introduced nocloning technique of Bitansky and Shmueli (STOC 2020) and Ananth and La Placa (ePrint 2019), which in turns builds on the classical nonblackbox technique of Bitansky, Khurana and Paneth (STOC 2019). Our approach relies on a new technical tool, spooky encryption for relations computable by quantum circuits, that we also construct. (2) Constantround postquantum nonmalleable commitments from mildly superpolynomial quantum hardness of LWE. This is the first construction of postquantum nonmalleable commitments in the plain model, and is obtained by transforming the construction of Khurana and Sahai (FOCS 2017) to obtain postquantum security. We achieve quantum security by building a new straightline nonblackbox simulator against parallel verifiers that does not clone the adversary's state. This technique may also be relevant to the classical setting.
READ FULL TEXT
Comments
There are no comments yet.