Zero-knowledge (ZK) applications form a large group of use cases in modern cryptography,
and recently gained in popularity due to novel proof systems. For many of these …

In this paper we describe ZKBoo, a proposal for practically efficient zero-knowledge
arguments especially tailored for Boolean circuits and report on a proof-ofconcept …

We construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …

By design, existing (pre-processing) zk-SNARKs embed a secret trapdoor in a relation-
dependent common reference strings (CRS). The trapdoor is exploited by a (hypothetical) …

How can a model owner prove they trained their model according to the correct
specification? More importantly, how can they do so while preserving the privacy of the …

Frequently, users on the web need to show that they are, for example, not a robot, old
enough to access an age restricted video, or eligible to download an ebook from their local …

We study the problem of building non-interactive proof systems modularly by linking small
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …

Cloud database systems such as Amazon RDS or Google Cloud SQLenable the
outsourcing of a large database to a server who then responds to SQL queries. A natural …

Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) have
emerged as a valuable tool for verifiable computation and privacy preserving protocols …

With the increasing interest in connected vehicles along with electrification opportunities,
there is an ongoing effort to automate the charging process of electric vehicles (EVs) through …