Frequently, users on the web need to show that they are, for example, not a robot, old
enough to access an age restricted video, or eligible to download an ebook from their local …

Federated machine learning (FL) allows to collectively train models on sensitive data as only
the clients' models and not their training data need to be shared. However, despite the …

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

Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs) allow a
prover to convince a verifier of the correct execution of a large computation in private and …

We present a generalized inner product argument and demonstrate its applications to
pairing-based languages. We apply our generalized argument to prove that an inner pairing …

This paper introduces Brakedown, 1 the first built system that provides linear-time SNARKs
for NP, meaning the prover incurs O (N) finite field operations to prove the satisfiability of an …

We propose hinTS—a new threshold signature scheme built on top of the widely used BLS
signatures. Our scheme enjoys the following attractive features: A silent setup process …

This paper initiates research on zero-knowledge middleboxes (ZKMBs). A ZKMB is a
network middlebox that enforces network usage policies on encrypted traffic. Clients send …

The labeling of electricity is considered an important mechanism to differentiate renewable
power generation and, thus, to incentivize the expansion of green energy. However, today's …

In the energy transition, there is an urgent need for decreasing overall carbon emissions.
Against this background, the purposeful and verifiable tracing of emissions in the energy …