Schnorr's signature scheme permits an elegant threshold signing protocol due to its linear
signing equation. However each new signature consumes fresh randomness, which can be …

This paper introduces CycleFold, a new and conceptually simple approach to instantiate
folding-scheme-based recursive arguments over a cycle of elliptic curves, for the purpose of …

Nova is an efficient recursive proof system built from an elegant folding scheme for (relaxed)
R1CS statements. The original Nova paper (CRYPTO'22) presented Nova using a single …

Recent advances in fast protocols for vector oblivious linear evaluation (VOLE) have
inspired a family of new VOLE-based lightweight designated-verifier NIZK protocols (Weng …

In the past decade, blockchains have seen various financial and technological innovations,
with cryptocurrencies reaching a market cap of over 1 trillion dollars. However, scalability is …

This paper introduces a new approach to reduce end-to-end costs in large-scale replicated
systems built under a Byzantine fault model. Specifically, our approach transforms a given …

Self-sovereign identity is the latest digital identity paradigm that allows users, organizations,
and things to manage identity in a decentralized fashion without any central authority …

Homomorphic encryption, which enables the execution of arithmetic operations directly on
ciphertexts, is a promising solution for protecting privacy of cloud-delegated computations …

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 …

We present Testudo, a new FFT-less SNARK with a near linear-time prover, constant-time
verifier, constant-size proofs and a square-root-size universal setup. Testudo is based on a …