Table 1 ZKP Four-Step Algorithm

Commit () → r

The algorithm provides a commitment r, which can verify the correctness of the proof about the secret s

Challenge () → e

The algorithm creates a random challenge e, which the verifier sends to the prover

Prove (e, ω, k) → s

The algorithm yields a proof s computed using the given e, the witness ω, and a random string k

Verify (r, e, s) → {1, 0}

The verification algorithm returns 1 if the verification result is accurate; if not, it returns 0