We finally close the long-standing problem of constructing a noninteractive zero-knowledge
(NIZK) proof system for any NP language with security based on the plain Learning With …

Isogeny-based assumptions have emerged as a viable option for quantum-secure
cryptography. Recent works have shown how to build efficient (public-key) primitives from …

We give new instantiations of the Fiat-Shamir transform using explicit, efficiently computable
hash functions. We improve over prior work by reducing the security of these protocols to …

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 …

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 …

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

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 …

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 …