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

We study the problem of designing non-interactive batch arguments for NP NP. Such an
argument system allows an efficient prover to prove multiple NP NP statements, with size …

We give the first construction of non-interactive zero-knowledge (NIZK) arguments from post-
quantum assumptions other than Learning with Errors. In particular, we achieve NIZK under …

We provide the first constructions of non-interactive zero-knowledge and Zap arguments for
NP based on the sub-exponential hardness of Decisional Diffie-Hellman against polynomial …

Abstract The Fiat-Shamir transform is a general method for reducing interaction in public-
coin protocols by replacing the random verifier messages with deterministic hashes of the …

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 …

We present a new approach for constructing non-interactive zero-knowledge (NIZK) proof
systems from vector trapdoor hashing (VTDH)--a generalization of trapdoor hashing [Döttling …

We give the first constructions in the plain model of 1) nonmalleable digital lockers (Canetti
and Varia, TCC 2009) and 2) robust fuzzy extractors (Boyen et al., Eurocrypt 2005) that …

Blockchain heralds the dawn of decentralized applications that coordinate proper
computations without requiring prior trust. Existing blockchain solutions, however, are …