Abstract We introduce Xiphos and Kopis, new transparent zero-knowledge succinct non-
interactive arguments of knowledge (zkSNARKs) for R1CS. They do not require a trusted …

Non-interactive zero-knowledge proofs of knowledge (NIZKPoK) serve as a key building
block in many important cryptographic constructions. Achieving universally composable …

Zero-knowledge proofs (ZKPs) enable a prover to convince a verifier that a given statement
is true without revealing anymore information other than the fact the statement is true …

Succinct non-interactive zero-knowledge arguments of knowledge (zk-SNARKs) are a type
of non-interactive proof system enabling efficient privacy-preserving proofs of membership …

Zero-Knowledge Proofs (ZKPs) are cryptographic primitives allowing a party to prove to
another party that the former knows some information while keeping it secret. Such a …

We present ZK-SecreC, a domain-specific language for zero-knowledge proofs. We present
the rationale for its design, its syntax and semantics, and demonstrate its usefulness on the …

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

Several recent short NIZK arguments are constructed in a modular way from a small number
of basic arguments like the product argument or the shift argument. The main technical …

Non-interactive zero-knowledge (NIZK) proofs can be an extremely powerful tool, allowing
one to prove a statement in a single message without revealing any information besides the …

We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …