Lightweight Zero Knowledge Arguments for Confidential Transactions and More

摘要

We propose an efficient zero-knowledge proof protocol to prove and verify computation results. The efficient zero-knowledge proof protocol for proving and verifying the operation result proposed in the present invention is based on the zero-knowledge proof protocol for a specific weighted dot product, does not require a trusted setup, and includes a short-length section of the proof. We propose a zero-knowledge proof protocol for arithmetic circuits with short proof lengths that do not require a zero-knowledge proof protocol and trusted setup.