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 …

We study how to construct zkSNARKs whose SRS is universal and updatable, ie, valid for all
relations within a size-bound and to which a dynamic set of participants can indefinitely add …

Private set-intersection (PSI) is one of the most practically relevant special-purpose secure
multiparty computation tasks, as it is motivated by many real-world applications. In this paper …

Traceability systems have changed the way food safety is managed and data is stored.
Blockchain tracking services now provide customers with an infrastructure that allows them …

We construct polynomial commitment schemes with constant sized evaluation proofs and
logarithmic verification time in the transparent setting. To the best of our knowledge, this is …

Abstract We optimize Zero Knowledge (ZK) proofs of statements expressed as RAM
programs over arithmetic values. Our arithmetic-circuit-based read/write memory uses only 4 …

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 …

Federated learning (FL) is a machine learning paradigm, which enables multiple and
decentralized clients to collaboratively train a model under the orchestration of a central …

Sigma protocols are one of the most common and efficient zero-knowledge proofs (ZKPs).
Over the decades, a large number of Sigma protocols are proposed, yet few works pay …

A succinct zero knowledge proof for regular language mem-bership, ie, to prove a secret
string behind an encryption (hash) belongs to a regular language is useful, eg, for asserting …