We present a non-interactive and public verifier scheme that allows one to assert the asset
of a financial organization instantly and incrementally in zero knowledge with high …

We present gOTzilla, a protocol for interactive zero-knowledge proofs for very large
disjunctive statements of the following format: given publicly known circuit C, and set of …

Often, in privacy-sensitive cryptographic protocols, a party commits to a secret message m
and later needs to prove that m belongs to a language L or that m does not belong to L (but …

Recently there has been much academic and industrial interest in practical implementations
of zero knowledge proofs. These techniques allow a party to prove to another party that a …

We describe a zero-knowledge proof system in which a prover holds a large dataset M and
can repeatedly prove NP relations about that dataset. That is, for any (public) relation R and …

In this paper we propose a novel technique for proving in zeroknowledge that a committed
value is on a public list. Our technique combines the concept of a hashtree with well-known …

Abstract Zero Knowledge Set Membership Proofs (zkSMPs) allow efficiently, ie sublinearly in
the size of the set, proving membership of a value in a set in zero knowledge with respect to …

Zero-knowledge arguments of knowledge are powerful cryptographic primitives that allow a
computationally strong prover to convince a weaker verifier for the validity of an NP …

The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are
based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for …

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 …