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) …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

We provide the first constructions of SNARGs for Batch-NP and P based solely on the sub-
exponential Decisional Diffie Hellman (DDH) assumption. Our schemes achieve poly …

Recent works on lattice-based extractable polynomial commitments can be grouped into two
classes:(i) non-interactive constructions that stem from the functional commitment by …

We establish new results on the Fiat-Shamir (FS) security of several protocols that are widely
used in practice, and we provide general tools for establishing similar results for others …

The main conceptual contribution of this paper is a unification of two leading paradigms for
constructing succinct argument systems, namely Kilian's protocol and the BMW (Biehl-Meyer …

We construct succinct non-interactive arguments (SNARGs) for bounded-depth
computations assuming that the decisional Diffie-Hellman (DDH) problem is sub …

Polynomial commitments schemes are a powerful tool that enables one party to commit to a
polynomial p of degree d, and prove that the committed function evaluates to a certain value …

One of the most fundamental results in game theory is that every finite strategic game has a
Nash equilibrium, an assignment of (randomized) strategies to players with the stability …