Polynomial commitment schemes (PCS) have recently been in the spotlight for their key role
in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field …

Non-interactive batch arguments for NP provide a way to amortize the cost of NP verification
across multiple instances. They enable a prover to convince a verifier of multiple NP …

We present position-hiding linkability for vector commitment schemes: one can prove in zero
knowledge that one or m values that comprise commitment\cm all belong to the vector of …

Succinct arguments allow a prover to convince a verifier of the validity of any statement in a
language, with minimal communication and verifier's work. Among other approaches, lattice …

Decentralized federated learning (DFL) is an emerging privacy-preserving machine learning
framework, where multiple data owners cooperate to train a global model without any …

We introduce and study the notion of fully linear probabilistically checkable proof systems. In
such a proof system, the verifier can make a small number of linear queries that apply jointly …

A zk-SNARK is a powerful cryptographic primitive that provides a succinct and efficiently
checkable argument that the prover has a witness to a public NP statement, without …

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

Non-interactive publicly verifiable secret sharing (PVSS) schemes enables (re-) sharing of
secrets in a decentralized setting in the presence of malicious parties. A recently proposed …

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