Plonk is a widely used succinct non-interactive proof system that uses univariate polynomial
commitments. Plonk is quite flexible: it supports circuits with low-degree “custom” gates as …

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

Succinct zero knowledge proofs (ie zkSNARKs) are powerful cryptographic tools that enable
a prover to convince a verifier that a given statement is true without revealing any additional …

Abstract Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs)
are becoming an increasingly fundamental tool in many real-world applications where the …

Traditional blockchain systems execute program state transitions on-chain, requiring each
network node participating in state-machine replication to re-compute every step of the …

To reduce the transmission cost of blockchain confidential transactions, we propose
SymmeProof, a novel communication efficient non-interactive zero-knowledge range proof …

We present Baloo, the first protocol for lookup tables where the prover work is linear on the
amount of lookups and independent of the size of the table. Baloo is built over the lookup …

In the algebraic group model (AGM), an adversary has to return with each group element a
linear representation with respect to input group elements. In many groups, it is easy to …

We introduce a class of interactive protocols, which we call sumcheck arguments, that
establishes a novel connection between the sumcheck protocol (Lund et al. JACM 1992) …

We propose a univariate sumcheck argument Count of essentially optimal communication
efficiency of one group element. While the previously most efficient univariate sumcheck …