Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
due to Claus P. Schnorr. He was a German mathematician and cryptographer. His protocol has three rounds and is defined over a cyclic group G of order q with generator g. In order to prove in zero-knowledge the language L={ (x,w): x = gʷ } where the witness w is the hard-to-compute discrete log