Commit-and-Prove Zero-Knowledge Proof systems (CP-ZKPs)[Kil89, CLOS02] generalize
zero-knowledge proofs where we prove statements about values that are committed. In this …

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 …

1.1 Background Zero-Knowledge Proofs [GMR85] are cryptographic primitives that allow
some entity (the prover) to prove to another party (the verifier) the validity of some statement …

In this proposal, we present a framework for enabling the interoperability of zero-knowledge
proof systems by defining a standard file format for the intermediate representations (in this …

Zero-knowledge proofs, introduced by Goldwasser, Micali, and Rackoff, are a fundamental
building block in theoretical cryptography with numerous applications. Still, the impact of …

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 …

In this work, we propose a simple framework of constructing efficient non-interactive zero-
knowledge proof (NIZK) systems for all NP. Compared to the state-of-the-art construction by …

Dubhe: Succinct Zero-Knowledge Proofs for Standard AES and related Applications Page 1
This paper is included in the Proceedings of the 32nd USENIX Security Symposium. August …

There are various good articles and examples trying to explain the logic behind Zero
Knowledge Proofs (ZKP). If you are not familiar with the concept, the notion of ZKP is that" a …

Abstract Zero Knowledge Proofs (ZKPs) are one of the most striking innovations in
theoretical computer science. In practice, the prevalent ZKP methods are, at times, too …