Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

Recent progress in interactive zero-knowledge (ZK) proofs has improved the efficiency of
proving large-scale computations significantly. Nevertheless, real-life applications (eg, in the …

Zero-knowledge (ZK) proofs with an optimal memory footprint have attracted a lot of
attention, because such protocols can easily prove very large computation with a small …

Zero knowledge proofs are an important building block in many cryptographic applications.
Unfortunately, when the proof statements become very large, existing zero-knowledge proof …

Distributed energy resources (DERs) are gaining prominence due to their advantages in
improving energy efficiency, reducing carbon emissions, and enhancing grid resilience …

Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on
their private inputs, and reveals nothing but the output of the function. In the last decade …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

We introduce and study a simple kind of proof system called line-point zero knowledge
(LPZK). In an LPZK proof, the prover encodes the witness as an affine line $\mathbf …

Interactive theorem provers (ITPs), such as Lean and Coq, can express formal proofs for a
large category of theorems, from abstract math to software correctness. Consider Alice who …

We show a constant-overhead interactive zero-knowledge (ZK) proof system for RAM
programs, that is, a ZK proof in which the communication complexity as well as the running …