How to generate a simulated proof in zkSNARK

Nerox

11/25/23, 6:06 PM

According to https://www.di.ens.fr/~nitulesc/files/Survey-SNARKs.pdf

in cryptography, we often want to hide information. A proof that does not reveal any information to the verifier besides the membership of the statement to the language is called a zero-knowledge proof. A way to formally define this property is to consider a simulator that is able to behave exactly as the prover in the protocol and to produce a ”fake” proof without knowing the witness. This should be done in a way that a verifier will not be able to tell if it interacts with the real prover or with this simulator. Intuitively, we can then argue that a honestly generated proof looks indistinguishable from a simulated value produced independently of the witness, meaning that the proof reveals as much information about the witness as this value, so basically zero-knowledge.

How is that fake proof generated, and what does it mean for the fake proof to be indistinguishable from a real proof ? (does it actually prove the statement ? probably not, then what value does this "fake" proof hold that make us compare it to the actual proof ?)

0 + 0

zero-knowledge-proofs

cryptocurrency

zero-knowledge

Elon Musk

I sit in a Tesla and translated this thread with Ai:

EN: How to generate a simulated proof in zkSNARK

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.