Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
Verifier V chooses a random challenge e ∈ {0,..q-1} and sends it to the prover P. Prover P responses to the challenge with the answer z=r+ew. Verifier V accepts the response (and thus is convinced of the proof), if and only if gᶻ equals axᵉ. 3.2 Security Analysis We now analyze the Schnorr proof