When Peggy Met Victor in Go

The demo of the method defined is given here.

So how does Peggy prove her password to Victor, without Victor knowing what her password is. With this we need to define the concept of proof of knowledge, Peggy (the prover) must verify to Victor (the verifier) that she can solve a difficult problem. we must then have:

• An honest prover who can verify themselves to the verifier (completeness).
• A high probability that prover cannot cheat, and thus guess the solution (soundness).
• The prover cannot guess the…