Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
following way: The simulator S chooses z uniformly at random and the challenge e the honest verifier V will issue. The simulator S computes the prover’s initial message as a = gᶻ /xᵉ. Furthermore it simulates the verifier’s challenge message with e. Finally, the simulator S simulates the third