search

naure / zk

A framework to build Zero-knowledge non-interactive proofs, based on the Fiat-Shamir heuristic, a proof-of-work, and a constant-size commitment scheme.
https://medium.com/@aurelcode/cryptographic-accumulators-da3aa4561d77
GNU General Public License v3.0
31 stars 1 forks source link

Question in tranform #1

Open sarthakg1234 opened 5 years ago

sarthakg1234 commented 5 years ago

just had a small question:

How can we attack a system which follows fiat-schamir heuristic given that the hash computed in by the prover in the second step only includes the provers public key and not the random challenge in step 1 as in the general protocol.

Why do we hash the random challenge along with the public key. Public key should be enough for the verifier to prove non-repudiation?

Thanking you

naure commented 5 years ago

Missing some context, which public key are you referring to?