Zero-knowledge proof (ZKP) is a cryptographic protocol that allows one party to prove the
correctness of a statement to another party without revealing any information beyond the …

We propose Flashproofs, a new type of efficient special honest verifier zero-knowledge
arguments with a transparent setup in the discrete logarithm (DL) setting. First, we put forth …

Recently, a self-sovereign identity model has been researched actively as an alternative to
the existing identity models such as a centralized identity model, federated identity model …

Lookup arguments allow to prove that the elements of a committed vector come from a
(bigger) committed table. They enable novel approaches to reduce the prover complexity of …

Interactive theorem provers (ITPs), such as Lean and Coq, can express formal proofs for a
large category of theorems, from abstract math to software correctness. Consider Alice who …

Polynomial commitments schemes are a powerful tool that enables one party to commit to a
polynomial p of degree d, and prove that the committed function evaluates to a certain value …

Minimizing the energy cost and carbon footprint of the Bitcoin blockchain and related
protocols is one of the most widely identified open questions in the cryptocurrency space …

A multilinear polynomial is a multivariate polynomial of degree at most one in each variable.
This paper introduces a new scheme to commit to multilinear polynomials and to later prove …

Verifiable registries allow clients to securely access a key-value mapping maintained by an
untrusted server. Registries must be audited to ensure global invariants are preserved …

Non-interactive batch arguments for NP provide a way to amortize the cost of NP verification
across multiple instances. In particular, they allow a prover to convince a verifier of multiple …