In recent years, the zero-knowledge proof and zero-knowledge succinct non-interactive
argument of knowledge (zk-SNARK) have drawn significant attention as privacy-enhancing …

Zero-knowledge proofs (ZKPs) are techniques to verify claims without revealing the
information itself. In this process, a “prover” shares proof of their claim with a “verifier,” who …

After the pioneering results proposed by Bellare et al in ASIACRYPT 2016, there have been
lots of efforts to construct zero-knowledge succinct non-interactive arguments of knowledge …

In their seminal work, Ishai, Kushilevitz, Ostrovsky, and Sahai (STOC '07) presented the
MPC-in-the-Head paradigm, which shows how to design Zero-Knowledge Proofs (ZKPs) …

Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short and
efficiently verifiable proofs. They elegantly resolve the juxtaposition of individual privacy and …

Recent work, including ZKBoo, ZKB++, and Ligero, has developed efficient non-interactive
zero-knowledge proofs of knowledge (NIZKPoKs) for Boolean circuits based on symmetric …

A non-interactive zero-knowledge (NIZK) protocol allows a prover to non-interactively
convince a verifier of the truth of the statement without leaking any other information. In this …

We introduce zkTree, a general framework for constructing a tree by recursively verifying
children's zero-knowledge proofs (ZKPs) in a parent ZKP node, while enabling the retrieval …

Zero-knowledge (ZK) protocols are undoubtedly among the central primitives in
cryptography, lending their power to numerous applications such as secure computation …

Blockchains are distributed systems that allow mutually distrusting parties to process
transactions in a censorship-resistant way while establishing an immutable transaction …