Succinct non-interactive arguments of knowledge (SNARKs) have found numerous
applications in the blockchain setting and elsewhere. The most efficient SNARKs require a …

Many cryptographic protocols rely upon an initial\emph {trusted setup} to generate public
parameters. While the concept is decades old, trusted setups have gained prominence with …

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 …

A mixnet developed by Hébant et al.(PKC'20) employs certified ciphertexts that carry
homomorphic signatures from an authority, reducing the complexity of the shuffling proof …

Zero-knowledge shuffle arguments are a useful tool for constructing mix-nets which enable
anonymous communication. We propose a new shuffle argument using a novel technique …

An extractable one-way function (EOWF), introduced by Canetti and Dakdouk (ICALP 2008)
and generalized by Bitansky et al.(SIAM Journal on Computing vol. 45), is an OWF that …

We live in a digital world. A significant part of our lives happens online, and we use the
internet for incredibly many different purposes and we rely on increasingly advanced …

An extractable one-way function (EOWF), introduced by Canetti and Dakdouk (ICALP 2008)
and generalized by Bitansky et al.(SIAM Journal on Computing vol. 45), is an OWF that …

Elliptic curves with a bilinear map, or pairing, have a rich algebraic structure that has been
fundamental to develop practical Non-Interactive Zero-Knowledge (NIZK) proofs. On the …