Cybersecurity, Cryptography.
unless she knows x. Victor then proves that Peggy still knows the secret (x) by first recovering: and then should compute the same challenge: If c1==c, it has been verified, and that Peggy has proven that she still knows x. This works because: All of this holds if g and h are in Qn and which is the