We present a framework for building efficient folding-based SNARKs. First we develop a
new “uniformizing” compiler for NP statements that converts any poly-time computation to a …

Zero-knowledge proofs (ZKPs) have evolved from being a theoretical concept providing
privacy and verifiability to having practical, real-world implementations, with SNARKs …

Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs) allow a
prover to convince a verifier of the correct execution of a large computation in private and …

Abstract Zero-Knowledge Proofs (ZKPs), a cryptographic tool known for decades, have
gained significant attention in recent years due to advancements that have made them …

In this paper, we explore a novel Zero-knowledge Virtual Machine (zkVM) framework
leveraging succinct, non-interactive zero-knowledge proofs for verifiable computation over …

We explore Zero-Knowledge Proofs (ZKPs) of statements expressed as programs written in
high-level languages, eg, C or assembly. At the core of executing such programs in ZK is the …

Space-efficient SNARKs aim to reduce the prover's space overhead which is one the main
obstacles for deploying SNARKs in practice, as it can be prohibitively large (eg, orders of …

This work presents Deepfold, a novel multilinear polynomial commitment scheme (PCS)
based on Reed-Solomon code that offers optimal prover time and a more concise proof size …

Abstract Collaborative zk-SNARK (USENIX'22) allows multiple parties to jointly create a zk-
SNARK proof over distributed secrets (also known as the witness). It provides a promising …

With the rapid development of the blockchain industry and the widespread adoption of IoT
devices, which are often deployed on different blockchains, the need for cross-chain value …