Cybersecurity, Cryptography.
Here’s my Sunday morning doodle: We can use Non-interactive zero-knowledge (NIZK) proofs, and where Peggy (the ‘Prover’) just has to prove that she still knows her secret (x). For equality (EQ) of discrete logarithms, we can prove that log_g(gx)==log_h(hx), and where Peggy does not have to reveal