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 …

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 …

We introduce Themis, a scheme for introducing fair ordering of transactions into
(permissioned) Byzantine consensus protocols with at most ƒ faulty nodes among n≥ 4ƒ+ 1 …

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 …

Data privacy is a key concern for smart contracts handling sensitive data. The existing work
zkay addresses this concern by allowing developers without cryptographic expertise to …

Zero-knowledge (ZK) proofs with an optimal memory footprint have attracted a lot of
attention, because such protocols can easily prove very large computation with a small …

We present a new succinct zero knowledge argument scheme for layered arithmetic circuits
without trusted setup. The prover time is O (C+ nlogn) and the proof size is O (D logC+ log 2 …

Abstract The celebrated Fiat-Shamir transformation turns any public-coin interactive proof
into a non-interactive one, which inherits the main security properties (in the random oracle …