In the pairing-based zero-knowledge succinct non-interactive arguments of knowledge (zk-
SNARK), there often exists a requirement for the proof system to be combined with …

With the rapid development of distributed computing, the traditional zero-knowledge proofs
(ZKP) are becoming less adequate for privacy-preserving applications in the distributed …

In recent years, many advances have been made in cryptography, as well as in the
performance of communication networks and processors. As a result, many advanced …

We propose SublonK---a new succinct non-interactive argument of knowledge (SNARK).
SublonK is the first SNARK that achieves both a constant proof size and prover runtime that …

One of the approaches to constructing zero knowledge (ZK) arguments relies on “PCP
techniques” that date back to influential works from the early 1990's Babai et al., Arora et al …

We propose a non-interactive product argument, that is more efficient than the one by Groth
and Lipmaa, and a novel shift argument. We then use them to design several novel non …

Zero-knowledge proofs of knowledge (ZK-PoK) are important building blocks for numerous
cryptographic applications. Although ZK-PoK have a high potential impact, their real world …

The communities of blockchains and distributed ledgers have been stirred up by the
introduction of zero-knowledge proofs (ZKPs). Originally designed as a solution to privacy …

Zero-knowledge proofs are an essential building block in many privacy-preserving systems.
However, implementing these proofs is tedious and error-prone. In this paper, we present …