# Zk Proof to Prove that I know the secret x of y = HASH(x)

Lets say I know a secret value x.

The hash of x, y = H(x) is public.

Is there any zk way to prove to a verifier that I know x without revealing x and only revealing y?

• It's much simpler to do this with asymmetric crypto. Is there scope for changing your protocol to achieve the same goal via different means? Aug 17 at 22:26