Simulation extractability is a strong security notion of zkSNARKs that guarantees that an
attacker who produces a valid proof must know the corresponding witness, even if the …

Most succinct arguments (SNARKs) are initially only proven knowledge sound (KS). We
show that the commonly employed compilation strategy from polynomial interactive oracle …

In proof-of-stake blockchains, liveness is ensured by repeatedly selecting random groups of
parties as leaders, who are then in charge of proposing new blocks and driving consensus …

The generic-group model (GGM) and the algebraic-group model (AGM) have been
exceptionally successful in proving the security of many classical and modern …

The universal composability (UC) model provides strong security guarantees for protocols
used in arbitrary contexts. While these guarantees are highly desirable, in practice, schemes …

Orion (Xie et al. CRYPTO'22) is a recent plausibly post-quantum zero-knowledge argument
system with a linear time prover. It improves over Brakedown (Golovnev et al. ePrint'21 and …

Cryptographic proof systems have a plethora of applications: from building other
cryptographic tools (eg, malicious security for MPC protocols) to concrete settings such as …

The Internet of Things (IoT) has greatly changed our lives and generated a large amount of
data. Cloud storage helps IoT limited-resource IoT devices process the massive data …

HyperPlonk is a recent SNARK proposal (Eurocrypt'23) that features a linear-time prover
and supports custom gates of larger degree than Plonk. For the time being, its instantiations …

In recent years, the field of privacy-preserving technologies has experienced considerable
expansion, with zero-knowledge proofs (ZKPs) playing one of the most prominent roles …