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 …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

Ledger-based systems that support rich applications often suffer from two limitations. First,
validating a transaction requires re-executing the state transition that it attests to. Second …

Our transaction history in the current centralized banking system has the ability to reveal a
lot of private information for each spender, both to the banking system itself, but also to those …

Machine learning has become increasingly prominent and is widely used in various
applications in practice. Despite its great success, the integrity of machine learning …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

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 …

Elections are an important corner stone of democratic processes. In addition to publishing
the final result (eg, the overall winner), elections typically publish the full tally consisting of all …

The wealth of user data acts as a fuel for network intelligence toward the sixth generation
wireless networks (6G). Due to data heterogeneity and dynamics, decentralized data …

Zero-knowledge middleboxes (ZKMBs) are a recent paradigm in which clients get privacy
and middleboxes enforce policy: clients prove in zero knowledge that the plaintext …