We construct the first actively-secure threshold version of the cryptosystem based on class
groups from the so-called CL framework (Castagnos and Laguillaumie, 2015). We show …

Interactive proof systems enable a verifier with limited resources to decide an intractable
language (or compute a hard function) by communicating with a powerful but untrusted …

Vector commitment schemes are compressing commitments to vectors that make it possible
to succinctly open a commitment for individual vector positions without revealing anything …

We propose protocols in the Compressed Sigma Protocol framework that achieve a succinct
verifier. Towards this, we construct a new inner product argument and cast it in the …

Vector commitment schemes are compressing commitments to vectors that make it possible
to succinctly open a commitment for individual vector positions without revealing anything …

The sumcheck protocol, introduced in 1992, is an interactive proof which is a key component
of many probabilistic proof systems in computational complexity theory and cryptography …

Our work aims to minimize interaction in secure computation due to the high cost and
challenges associated with communication rounds, particularly in scenarios with many …

Federated learning is an important distributed model training technique in Internet of Things
(IoT), in which participant selection is a key component that plays a role in improving training …

We introduce and formally define Multivariate Multi-Polynomial (MMP) commitment, a
commitment scheme on multiple multivariate polynomials, and illustrate the concept with an …

Modern SNARK designs usually feature a frontend-backend paradigm: The frontend
compiles a user's program into some equivalent circuit representation, while the backend …