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 …

Blockchains have seen growing traction with cryptocurrencies reaching a market cap of over
1 trillion dollars, major institution investors taking interests, and global impacts on …

Abstract zk-SNARK constructions that utilize an updatable universal structured reference
string remove one of the main obstacles in deploying zk-SNARKs [GKMMM, Crypto 2018] …

We present a methodology to construct preprocessing zkSNARKs where the structured
reference string (SRS) is universal and updatable. This exploits a novel use of holography …

We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

In the past decade, blockchains have seen various financial and technological innovations,
with cryptocurrencies reaching a market cap of over 1 trillion dollars. However, scalability is …

Non-interactive arguments of knowledge are powerful cryptographic tools that can be used
to demonstrate the faithful execution of arbitrary computations with publicly verifiable proofs …

We introduce a new approach to realize incrementally verifiable computation (IVC), in which
the prover recursively proves the correct execution of incremental computations of the form …