We construct polynomial commitment schemes with constant sized evaluation proofs and
logarithmic verification time in the transparent setting. To the best of our knowledge, this is …

We construct a polynomial commitment scheme with constant (ie, independent of the
degree) sized evaluation proofs and logarithmic (in the degree) verification time in the …

We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …

Abstract We introduce Xiphos and Kopis, new transparent zero-knowledge succinct non-
interactive arguments of knowledge (zkSNARKs) for R1CS. They do not require a trusted …

We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …

Succinctness and zero-knowledge are two fundamental properties in the study of
cryptographic proof systems. Several recent works have formalized the connections …

We prove that the seminal KZG polynomial commitment scheme (PCS) is black-box
extractable under a simple falsifiable assumption ARSDH. To create an interactive …

In their celebrated work, Groth and Sahai [EUROCRYPT'08, SICOMP'12] constructed non-
interactive zero-knowledge (NIZK) proofs for general bilinear group arithmetic relations …

This paper introduces Spartan, a new family of zero-knowledge succinct non-interactive
arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …

We study sufficient conditions to compile simulation-extractable zkSNARKs from information-
theoretic interactive oracle proofs (IOP) using a simulation-extractable commit-and-prove …