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 …

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 …

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 construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …

Blockchain technology promises a decentralized ecosystem for building apps with
decentralized ownership and high security level. One of the most adopted blockchain …

The area of practical computational integrity proof systems, like SNARKs, STARKs,
Bulletproofs, is seeing a very dynamic development with several constructions having …

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 …

We present a new methodology to efficiently realize recursive composition of succinct non-
interactive arguments of knowledge (SNARKs). Prior to this work, the only known …

Deep learning techniques with neural networks are developing prominently in recent years
and have been deployed in numerous applications. Despite their great success, in many …

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 …