The setup is the following:
- Alice has a secret
- Alice can generate proofs
P1, P2, P3, ...
- Bob (an outsider) should be able to prove that any two proofs come from the same
xwithout communicating with Alice
Does such a proving protocol exist?
This feels like a problem belonging to the realms of non-interactive zero-knowledge protocols.
I've been reading on Fiat-Shamir, Chaum-Pedersen and Schnorr protocols.
- Fiat-shamir: requires that Alice and Bob agree on two public values G and H beforehand
- Chaum-pedersen: This should work, but I need a quick confirmation to know whether this is what i'm looking for. Is it safe to have only two public values that Alice generates proofs for, even though she needs to generate more than two proofs?
- Schnorr: is meant to prove knowledge of
x, but not equality of a proof of
xso this doesn't work
Is there a simpler way than ZK or am I overthinking this? Many thanks in advance