We provide the first construction of a succinct non-interactive argument (SNARG) for all
polynomial time deterministic computations based on standard assumptions. For T steps of …

We show the following hold, unconditionally unless otherwise stated, relative to a random
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …

We construct a succinct non-interactive publicly-verifiable delegation scheme for any log-
space uniform circuit under the sub-exponential Learning With Errors (LWE) assumption. For …

What does it mean to commit to a quantum state? In this work, we propose a simple answer:
a commitment to quantum messages is binding if, after the commit phase, the committed …

We obtain publicly verifiable Succinct Non-Interactive Arguments (SNARGs) for arbitrary
deterministic computations and bounded space non-deterministic computation from …

We construct a constant-round zero-knowledge classical argument for NP secure against
quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and …

In a seminal work, Goldreich, Micali and Wigderson (CRYPTO'86) demonstrated the wide
applicability of zero-knowledge proofs by constructing such a proof system for the NP …

Constructing collision-resistant hash families (CRHFs) from one-way functions is a long-
standing open problem and source of frustration in theoretical cryptography. In fact, there are …

Batch proofs are proof systems that convince a verifier that x 1,…, xt∈ L, for some NP
language L, with communication that is much shorter than sending the t witnesses. In the …

We devise a new partitioned simulation technique for MPC where the simulator uses
different strategies for simulating the view of aborting adversaries and non-aborting …